[moonjonghoo] 05.01.13 (#22)

* String_Reversal / 기초

* control_z / 기초

* I_don't_like_English /기초

* String_Calculation / 기초

* Crane_Doll_Picking_Game / 중급

Author: Moonjonghoo

Moonjonghoo/stack/Crane_Doll_Picking_Game.js

@@ -0,0 +1,21 @@
+function solution(board, moves) {
+  let N = board.length;
+  let stack = [];
+  let count = 0;
+  for (let i = 0; i < moves.length; i++) {
+    for (let j = 0; j < N; j++) {
+      if (board[j][moves[i] - 1] !== 0) {
+        stack.push(board[j][moves[i] - 1]);
+        if (stack[stack.length - 1] == stack[stack.length - 2]) {
+          count++;
+          count++;
+          stack.pop();
+          stack.pop();
+        }
+        board[j][moves[i] - 1] = 0;
+        break;
+      }
+    }
+  }
+  return count;
+}

Moonjonghoo/stack/I_don't_like_English.js

@@ -0,0 +1,20 @@
+function solution(numbers) {
+  const strN = [
+    "zero",
+    "one",
+    "two",
+    "three",
+    "four",
+    "five",
+    "six",
+    "seven",
+    "eight",
+    "nine",
+  ];
+
+  strN.forEach((nums, index) => {
+    numbers = numbers.split(nums).join(index);
+  });
+
+  return Number(numbers);
+}

Moonjonghoo/stack/String_Calculation.js

@@ -0,0 +1,17 @@
+function solution(my_string) {
+  const splited = my_string.split(" ");
+
+  let ans = Number(splited[0]);
+
+  splited.forEach((item, index) => {
+    if (item === "+") {
+      ans += Number(splited[index + 1]);
+    }
+
+    if (item === "-") {
+      ans -= Number(splited[index + 1]);
+    }
+  });
+
+  return ans;
+}

Moonjonghoo/stack/String_Reversal.js

@@ -0,0 +1,11 @@
+function solution(my_string) {
+  let arr = [];
+  for (let i = 0; i < my_string.length; i++) {
+    arr.push(my_string[i]);
+  }
+  let newarr = arr.sort(function (a, b) {
+    return a - b;
+  });
+  let answer = newarr.toString();
+  return answer;
+}

Moonjonghoo/stack/control_z.js

@@ -0,0 +1,8 @@
+function solution(s) {
+  const stack = [];
+  s.split(" ").forEach((target) => {
+    if (target === "Z") stack.pop();
+    else stack.push(+target);
+  });
+  return stack.length ? stack.reduce((pre, cur) => pre + cur) : 0;
+}