[tkddbs587] 25.01.02 (codingTestStd#6)

* Array slicing / 기초

* Length of array elements / 기초

* Rotate array / 기초

* Divisible number array / 중급

* Remove_smallest_number / 중급

* Matrix addition / 중급

Author: tkddbs587

tkddbs587/.gitkeep

@@ -0,0 +1,3 @@
+function solution(numbers, num1, num2) {
+  return numbers.slice(num1, num2 + 1);
+}

tkddbs587/Array/Array_slicing.js

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

tkddbs587/Array/Matrix_addition.js

@@ -0,0 +1,12 @@
+function solution(arr) {
+  let minNum = Math.min(...arr);
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] === minNum) {
+      arr.splice(i, 1);
+      if (arr.length === 0) {
+        arr.push(-1);
+      }
+    }
+  }
+  return arr;
+}

tkddbs587/Array/Remove_smallest_number.js

@@ -0,0 +1,11 @@
+function solution(numbers, direction) {
+  if (direction === "right") {
+    const lastElement = numbers.pop();
+    numbers.unshift(lastElement);
+  } else if (direction === "left") {
+    const firstElement = numbers.shift();
+    numbers.push(firstElement);
+  }
+
+  return numbers;
+}

tkddbs587/Array/Rotate_array.js

@@ -0,0 +1,10 @@
+function solution(arr, divisor) {
+  let newArr = arr.filter((el) => el % divisor === 0); // 나누어 떨어지는 엘리먼트가 담긴 새 배열 반환
+
+  // 나누어 떨어지는 엘리먼트 없으면 그냥 [-1] 반환
+  if (newArr.length === 0) {
+    return [-1];
+  }
+
+  return newArr.sort((a, b) => a - b); // 오름차순 정렬
+}

tkddbs587/Array/divisible_number_array.js

@@ -0,0 +1,3 @@
+function solution(array, n) {
+  return array.filter((el) => el === n).length;
+}

tkddbs587/Array/duplicate_count.js

@@ -0,0 +1,3 @@
+function solution(strlist) {
+  return strlist.map((str) => str.length);
+}