[JustDevRae] 25.01.16 (#26)

* remove smallest number / 중급

* divisible numbers array / 중급

* duplicate number count / 기초

* matrix addition / 중급

* array element length / 기초

* rotate array / 기초

* slice array / 기초

* array algorithm md file

* reverse string / 기초

* control Z / 기초

* dart game / 중급

* valid parentheses / 중급

* crane claw game / 중급

* pair count / 기초

* find point position / 기초

* login success / 기초

* card bundle / 중급

* make hamburger / 중급

* process / 심화

Author: JustDevRae

JustDevRae/Queue/card_bundle.js

@@ -0,0 +1,15 @@
+function solution(cards1, cards2, goal) {
+  var answer = "";
+  for (let word of goal) {
+    if (word == cards1[0]) {
+      cards1.shift();
+    } else if (word == cards2[0]) {
+      cards2.shift();
+    } else {
+      answer = "No";
+      break;
+    }
+  }
+
+  return (answer = "Yes");
+}

JustDevRae/Queue/find_point_position.js

@@ -0,0 +1,10 @@
+function solution(dot) {
+  var answer = 0;
+
+  if (dot[0] > 0 && dot[1] > 0) answer = 1;
+  if (dot[0] < 0 && dot[1] > 0) answer = 2;
+  if (dot[0] < 0 && dot[1] < 0) answer = 3;
+  if (dot[0] > 0 && dot[1] < 0) answer = 4;
+
+  return answer;
+}

JustDevRae/Queue/login_success.js

@@ -0,0 +1,16 @@
+function solution(id_pw, db) {
+  var answer = "";
+  for (let i = 0; i < db.length; i++) {
+    if (id_pw[0] === db[i][0]) {
+      if (id_pw[1] === db[i][1]) {
+        answer = "login";
+        break;
+      }
+      answer = "wrong pw";
+      break;
+    } else {
+      answer = "fail";
+    }
+  }
+  return answer;
+}

JustDevRae/Queue/make_hamburger.js

@@ -0,0 +1,20 @@
+function solution(ingredient) {
+  const burger = [];
+  let answer = 0;
+  for (let i of ingredient) {
+    burger.push(i);
+
+    if (
+      burger.length >= 4 &&
+      burger[burger.length - 4] === 1 &&
+      burger[burger.length - 3] === 2 &&
+      burger[burger.length - 2] === 3 &&
+      burger[burger.length - 1] === 1
+    ) {
+      burger.splice(burger.length - 4, 4);
+      answer++;
+    }
+  }
+
+  return answer;
+}

JustDevRae/Queue/pair_count.js

@@ -0,0 +1,13 @@
+function solution(n) {
+  var answer = 0;
+
+  // 1부터 n까지 숫자를 확인
+  for (let i = 1; i <= n; i++) {
+    // i가 n의 약수인지 확인
+    if (n % i === 0) {
+      // i가 n의 약수인지 확인
+      answer++;
+    }
+  }
+  return answer;
+}

JustDevRae/Queue/process.js

@@ -0,0 +1,20 @@
+function solution(priorities, location) {
+  var answer = 0;
+  const queue = priorities.map((priority, index) => ({ priority, index }));
+
+  while (queue.length > 0) {
+    const current = queue.shift();
+
+    const highPriority = queue.some((item) => item.priority > current.priority);
+
+    if (highPriority) {
+      queue.push(current);
+    } else {
+      answer++;
+
+      if (current.index === location) {
+        return answer;
+      }
+    }
+  }
+}