[unn04012] 25.01.16 (#29)

* 배열 자르기, 기초

* 배열 회전시키기, 기초

* 제일 작은 수 제거하기, 중급

* 나누어 떨어지는 숫자 배열, 중급

* 행렬의 곱셈, 심화

* 문자열 뒤집기(기초)

* 컨트롤_제트(기초)

* 영어가_싫어요(기초)

* 문자열_계산하기(기초)

* 크레인 인형뽑기 게임(중급)

* 순서쌍의 갯수(기초)

* 점위 위치 구하기(기초)

* 카드뭉치(중급)

* 햄버거만들기(중급)

* 프로세스(심화)

Author: unn04012

unn04012/queue/Number_of_pairs.js

@@ -0,0 +1,8 @@
+function solution(n) {
+  const divisors = [];
+
+  for (let i = 1; i <= n; i++) if (n % i === 0) divisors.push(i);
+  return divisors.length;
+}
+
+console.log(solution(100));

unn04012/queue/card.js

@@ -0,0 +1,20 @@
+function solution(cards1, cards2, goal) {
+  const reversedCard1 = cards1.reverse();
+  const reversedCard2 = cards2.reverse();
+
+  for (const word of goal) {
+    let flag = false;
+    if (reversedCard1[reversedCard1.length - 1] === word) {
+      reversedCard1.pop();
+      flag = true;
+    } else if (reversedCard2[reversedCard2.length - 1] === word) {
+      reversedCard2.pop();
+      flag = true;
+    }
+    if (!flag) return 'No';
+  }
+
+  return 'Yes';
+}
+
+console.log(solution(['i', 'drink', 'water'], ['want', 'to'], ['i', 'want', 'to', 'drink', 'water']));

unn04012/queue/finding_the_position_of_a_point.js

@@ -0,0 +1,27 @@
+function solution(dot) {
+  let answer = 0;
+  const [x, y] = dot;
+
+  const quadrant = [
+    [1, 1],
+    [-1, 1],
+    [-1, -1],
+    [1, -1],
+  ];
+
+  for (let i = 0; i < quadrant.length; i++) {
+    const [x, y] = quadrant[i];
+
+    const newX = x * dot[0];
+    const newY = y * dot[1];
+
+    if (newX > 0 && newY > 0) {
+      answer = i + 1;
+      break;
+    }
+  }
+
+  return answer;
+}
+
+console.log(solution([-7, 9]));

unn04012/queue/hambuger.js

@@ -0,0 +1,20 @@
+function solution(ingredients) {
+  let answer = 0;
+  const queue = [];
+
+  for (const ingredient of ingredients) {
+    queue.push(ingredient);
+    if (queue.length >= 4) {
+      const hamburger = queue.slice(-4).join('');
+
+      if (hamburger === '1231') {
+        answer++;
+        for (let i = 0; i < 4; i++) queue.pop();
+      }
+    }
+  }
+
+  return answer;
+}
+
+console.log(solution([2, 1, 1, 2, 3, 1, 2, 3, 1]));

unn04012/queue/process.js

@@ -0,0 +1,24 @@
+function solution(priorities, location) {
+  let answer = 1;
+  const queue = [];
+
+  const prioritiesWithIndex = priorities.map((priority, index) => ({ priority, index }));
+
+  while (prioritiesWithIndex.length) {
+    const { priority, index } = prioritiesWithIndex.shift();
+
+    const checkPriority = prioritiesWithIndex.findIndex((e) => e.priority > priority);
+
+    // 우선순위가 더 큰 프로세스가 없으면
+    if (checkPriority === -1) {
+      if (location === index) return queue.length + 1;
+      queue.push(priority);
+      continue;
+    }
+
+    prioritiesWithIndex.push({ priority, index });
+  }
+
+  return answer;
+}
+console.log(solution([1, 1, 9, 1, 1, 1], 0));