[JooKangsan] 25.01.02

JooKangSan/[week1]Array/ Number_of_duplicate_numbers.js

@@ -0,0 +1,13 @@
+function solution(array, n) {
+  var answer = 0;
+  for(let i=0 ; i<array.length; i++) {
+  if(n == array[i]){
+           answer += 1;
+  }
+  }
+  return answer;
+}
+
+function solution(array, n) {
+  return array.filter(element => element === n).length;
+}

JooKangSan/[week1]Array/ Remove_smallest_number.js

@@ -0,0 +1,9 @@
+function solution(arr) {
+  var answer = [];
+
+  if (arr.length === 1) return [-1];
+
+  const min = Math.min(...arr);
+  answer = arr.filter((num) => num !== min);
+  return answer;
+}

JooKangSan/[week1]Array/Array_of_numbers_that_fall_apart.js

@@ -0,0 +1,16 @@
+function solution(arr, divisor) {
+  const answer = [];
+  for(let num of arr) {
+      if(num % divisor === 0) {
+          answer.push(num);
+      }
+  }
+  if(answer.length === 0) return [-1];
+
+  return answer.sort((a, b) => a - b);
+}
+
+function solution(arr, divisor) {
+  const answer = arr.filter(num => num % divisor === 0).sort((a, b) => a - b);
+  return answer.length ? answer : [-1];
+}

JooKangSan/[week1]Array/Length_of_elements_in_array.js

@@ -0,0 +1,11 @@
+function solution(strlist) {
+  var answer = [];
+  for(let i=0; i<strlist.length; i++){
+      answer[i]=strlist[i].length
+  }
+      return answer;
+}
+
+function solution(strlist) {
+    return strlist.map(str => str.length);
+}

JooKangSan/[week1]Array/Matrix_addition.js

@@ -0,0 +1,19 @@
+function solution(arr1, arr2) {
+  const answer = [];
+
+  for(let i = 0; i < arr1.length; i++) {
+      const row = [];
+      for(let j = 0; j < arr1[0].length; j++) {
+          row.push(arr1[i][j] + arr2[i][j]);
+      }
+      answer.push(row);
+  }
+
+  return answer;
+}
+
+function solution(arr1, arr2) {
+  return arr1.map((row, i) => 
+      row.map((element, j) => element + arr2[i][j])
+  );
+}

JooKangSan/[week1]Array/Rotate_array.js

@@ -0,0 +1,19 @@
+function solution(numbers, direction) {
+  var answer = [];
+  if(direction == "right"){
+      numbers.unshift(numbers[numbers.length-1])
+      numbers.pop();
+  }else{
+      numbers.push(numbers[0])
+      numbers.shift();
+  }
+  answer = numbers
+  return answer;
+}
+
+function solution(numbers, direction) {
+  if(direction === "right") {
+      return [numbers[numbers.length-1], ...numbers.slice(0, -1)];
+  }
+  return [...numbers.slice(1), numbers[0]];
+}

JooKangSan/[week1]Array/Trim_Array.js

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