[yulrang] 25.01.09

yulrang/01_Array/01_Slice_array.js

@@ -0,0 +1,8 @@
+function solution(numbers, num1, num2) {
+  var answer = [];
+
+  for(let i = num1; i <= num2; i++){
+      answer.push(numbers[i]);
+  }
+  return answer;
+}

yulrang/01_Array/02_Length_of_array_items.js

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

yulrang/01_Array/03_Shift_array.js

@@ -0,0 +1,16 @@
+function solution(numbers, direction) {
+  var answer = [];
+  if (direction === "left") {
+      for(let i=1; i<numbers.length; i++) {
+          answer.push(numbers[i])
+      }
+      answer.push(numbers[0]);
+  }
+  if (direction === "right") {
+      answer.push(numbers[numbers.length-1]);
+      for(let i=0; i<numbers.length-1; i++) {
+          answer.push(numbers[i])
+      }
+  }
+  return answer;
+}

yulrang/01_Array/04_Number_of_duplicated_item.js

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

yulrang/01_Array/05_Remove_lowest_number.js

@@ -0,0 +1,7 @@
+function solution(arr) {
+  if (arr.length === 1) {
+      return [-1];
+  }
+
+  return arr.filter((el) => el !== Math.min(...arr));
+}

yulrang/01_Array/06_Sum_of_matrix.js

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

yulrang/01_Array/07_Multiple_number.js

@@ -0,0 +1,12 @@
+function solution(arr, divisor) {
+  var answer = [];
+
+  arr.forEach((el) => {
+      if(el % divisor === 0) answer.push(el);
+  })
+  answer.sort((a,b) => a-b);
+
+  if(answer.length === 0) return [-1];
+
+  return answer;
+}

yulrang/02_Stack/01_Reverse_string.js

@@ -0,0 +1,5 @@
+function solution(my_string) {
+  var answer = '';
+  answer = my_string.split('').reverse().join('');
+  return answer;
+}

yulrang/02_Stack/02_Ctrl_Z.js

@@ -0,0 +1,15 @@
+function solution(s) {
+  var answer = 0;
+  let arr = s.split(' ');
+  let newArr = [];
+
+  for(let i=0; i<arr.length; i++) {
+      if( arr[i] !== 'Z' ) {
+          newArr.push(arr[i]);
+      } else {
+          newArr.pop(arr[i-1])
+      }
+  }
+  answer = newArr.reduce((acc, cur) => acc + Number(cur), 0);
+  return answer;
+}

yulrang/02_Stack/03_English.js

@@ -0,0 +1,22 @@
+function solution(numbers) {
+  var answer = 0;
+  const numberObj = {
+      zero : 0,
+      one : 1,
+      two : 2,
+      three : 3,
+      four : 4,
+      five : 5,
+      six : 6,
+      seven : 7,
+      eight : 8,
+      nine : 9,
+  }
+
+  for ( const num in numberObj ){
+      numbers = numbers.replaceAll(num, numberObj[num]);    
+  }
+  answer = Number(numbers);
+
+  return answer;
+}

yulrang/02_Stack/04_Calculate_string.js

@@ -0,0 +1,21 @@
+function solution(my_string) {
+  var answer = 0;
+  let newArr = [];
+  my_string.split(' ').forEach((el, idx, arr) => {
+      if(idx === 0) {
+          newArr.push(Number(el));
+      }
+      if(el === '+' || el === '-') {
+          newArr.push(Number(arr[idx + 1]))
+          if (el === '+'){
+              answer = newArr[0] + newArr[1];
+          } else {
+              answer = newArr[0] - newArr[1];
+          }
+          newArr = [];
+          newArr.push(answer);
+      }
+  })
+  answer = newArr[0];
+  return answer;
+}

yulrang/02_Stack/05_KaKao_game.js

@@ -0,0 +1,26 @@
+function solution(board, moves) {
+  let answer = 0;
+  let basket = [];
+
+  const runBasket = () => {
+      for(let i=basket.length-1; i>0; i--) {
+          if(basket[i] === basket[i-1]) {
+              basket.splice(i-1, 2);
+              answer += 2;
+          }
+      }
+  }
+
+  for(let i=0; i<moves.length; i++) {
+      for(let j=0; j<board[0].length; j++) {
+          if(board[j][moves[i]-1] !== 0){
+              basket.push(board[j][moves[i]-1]);            
+              board[j][moves[i]-1] = 0;
+              runBasket();
+              break;
+          }
+      }
+  }
+
+  return answer;
+}