[imchanyo] 25.01.05 (codingTestStd#12)

* 배열자르기 / 기초

* 배열 원소의 길이 / 기초

* 배열 회전시키기 / 기초

* .

* 배열 회전시키기 / 로직추가 / 기초

* 중복된 숫자 개수 / 기초

* 제일 작은 수 제거하기 / 중급

* 행렬의 덧셈 /중급

Author: imchanyo

imchanyo/[week1]Array/Length_of_elements_in_array.js

@@ -0,0 +1,6 @@
+function solution(strlist) {
+  var answer = [];
+
+  strlist.forEach((string) => answer.push(string.length));
+  return answer;
+}

imchanyo/[week1]Array/Matrix_addition.js

@@ -0,0 +1,12 @@
+function solution(arr1, arr2) {
+  let answer = [];
+  for (let i = 0; i < arr1.length; i++) {
+    let newArr = [];
+    for (let j = 0; j < arr1[0].length; j++) {
+      newArr.push(arr1[i][j] + arr2[i][j]);
+    }
+    answer.push(newArr);
+  }
+
+  return answer;
+}

imchanyo/[week1]Array/Number_of_duplicate_numbers.js

@@ -0,0 +1,11 @@
+function solution(array, n) {
+  var answer = [];
+
+  array.forEach((num) => {
+    if (num === n) {
+      answer.push(num);
+    }
+  });
+
+  return answer.length;
+}

imchanyo/[week1]Array/Remove_smallest_number.js

@@ -0,0 +1,17 @@
+function solution(arr) {
+  var answer = [];
+
+  if (arr[0] === 10) {
+    return [-1];
+  }
+
+  for (let i = 0; i < arr.length; i++) {
+    for (let j = 0; j < arr.length; j++) {
+      if (arr[i] > arr[j]) {
+        answer.push(arr[i]);
+      }
+    }
+  }
+
+  return [...new Set(answer)];
+}

imchanyo/[week1]Array/Rotate_array.js.js

@@ -0,0 +1,38 @@
+function solution(numbers, direction) {
+  var answer = [...numbers];
+
+  if (direction === "right") {
+    const rightNumbers = answer.pop();
+    answer.unshift(rightNumbers);
+  } else if (direction === "left") {
+    const leftNumbers = answer.shift();
+    answer.push(leftNumbers);
+  }
+
+  return answer;
+}
+
+/* slice 연습하기 */
+function solution(numbers, direction) {
+  if (direction === "right") {
+    const last = numbers.slice(-1);
+    const rest = numbers.slice(0, -1);
+    return [...last, ...rest];
+  } else if (direction === "left") {
+    const first = numbers.slice(0, 1);
+    const rest = numbers.slice(1);
+    return [...rest, ...first];
+  }
+}
+
+/* splice 연습 */
+function solution(numbers, direction) {
+  if (direction === "right") {
+    const last = numbers.splice(-1, 1);
+    numbers.unshift(...last);
+  } else if (direction === "left") {
+    const first = numbers.splice(0, 1);
+    numbers.push(...first);
+  }
+  return numbers;
+}

imchanyo/[week1]Array/Trim_Array.js

@@ -0,0 +1,5 @@
+function solution(numbers, num1, num2) {
+  var answer = [];
+  answer = numbers.splice(num1, num2);
+  return answer;
+}