[Bona1122] 25.01.16 (#25)

* Card bundle / 중급

* Park walk / 중급

* Burger making / 중급

* Process / 심화

* Feature dev / 심화

* Truck on bridge / 심화

Author: bona1122

bona1122/[week3]Queue/Burger_making.js

@@ -0,0 +1,18 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/133502
+
+function solution(ingredient) {
+  let stack = [];
+  let result = 0;
+  for (let i = 0; i < ingredient.length; i++) {
+    let item = ingredient[i];
+    stack.push(item);
+    if (stack.length >= 4) {
+      let last4 = stack.slice(-4);
+      if (last4.join("") === "1231") {
+        result++;
+        stack.splice(-4);
+      }
+    }
+  }
+  return result;
+}

bona1122/[week3]Queue/Card_bundle.js

@@ -0,0 +1,28 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/159994
+
+// 1. 큐를 활용한 방법
+const solution1 = (cards1, cards2, goal) => {
+  for (let i = 0; i < goal.length; i++) {
+    if (goal[i] === cards1[0]) {
+      cards1.shift();
+    } else if (goal[i] === cards2[0]) {
+      cards2.shift();
+    } else return "No";
+  }
+  return "Yes";
+};
+
+// 2. 포인터를 활용한 방법
+const solution2 = (cards1, cards2, goal) => {
+  let p1 = 0,
+    p2 = 0;
+
+  for (const word of goal) {
+    if (word === cards1[p1]) {
+      p1++;
+    } else if (word === cards2[p2]) {
+      p2++;
+    } else return "No";
+  }
+  return "Yes";
+};

bona1122/[week3]Queue/Feature_dev.js

@@ -0,0 +1,42 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/42586
+
+const solution = (progresses, speeds) => {
+  let result = [];
+  const expectedTerm = progresses.map((progress, i) => {
+    return Math.ceil((100 - progress) / speeds[i]);
+  });
+  let ready = expectedTerm[0];
+  let featCnt = 1;
+  for (let i = 1; i < expectedTerm.length; i++) {
+    if (ready >= expectedTerm[i]) {
+      featCnt++;
+    } else {
+      result = [...result, featCnt];
+      featCnt = 1;
+      ready = expectedTerm[i];
+    }
+  }
+  result = [...result, featCnt];
+  return result;
+};
+
+// 큐를 활용한 버전
+function solution(progresses, speeds) {
+  const result = [];
+  const queue = progresses.map((progress, i) => {
+    return Math.ceil((100 - progress) / speeds[i]);
+  });
+
+  while (queue.length > 0) {
+    const expectedTerm = queue[0];
+    let featCnt = 0;
+
+    while (queue.length > 0 && queue[0] <= expectedTerm) {
+      queue.shift();
+      featCnt++;
+    }
+    result.push(featCnt);
+  }
+
+  return result;
+}

bona1122/[week3]Queue/Park_walk.js

@@ -0,0 +1,49 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/172928
+
+function solution(park, routes) {
+  let answer;
+  for (let i = 0; i < park.length; i++) {
+    for (let j = 0; j < park[i].length; j++) {
+      if (park[i][j] === "S") {
+        answer = [i, j];
+        break;
+      }
+    }
+  }
+
+  const [row, col] = [park.length, park[0].length];
+  const map = {
+    E: [0, 1],
+    W: [0, -1],
+    N: [-1, 0],
+    S: [1, 0],
+  };
+
+  for (let route of routes) {
+    const [op, n] = route.split(" ");
+    const [dx, dy] = map[op];
+    const [x, y] = answer;
+    const newX = x + dx * Number(n);
+    const newY = y + dy * Number(n);
+
+    // 다음 위치가 공원을 벗어나는지 체크
+    if (newX < 0 || newX >= row || newY < 0 || newY >= col) continue;
+
+    // 장애물 체크
+    let isBlocked = false;
+    for (let i = 1; i <= Number(n); i++) {
+      const checkX = x + dx * i;
+      const checkY = y + dy * i;
+      if (park[checkX][checkY] === "X") {
+        isBlocked = true;
+        break;
+      }
+    }
+
+    if (!isBlocked) {
+      answer = [newX, newY];
+    }
+  }
+
+  return answer;
+}

bona1122/[week3]Queue/Process.js

@@ -0,0 +1,18 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/42587
+
+function solution(priorities, location) {
+  const queue = priorities.map((item, idx) => [item, idx]);
+  let poppedNum = 0;
+
+  while (queue.length > 0) {
+    const current = queue.shift();
+    const isHighestPriority = queue.every((item) => item[0] <= current[0]);
+
+    if (isHighestPriority) {
+      poppedNum++;
+      if (current[1] === location) return poppedNum;
+    } else {
+      queue.push(current);
+    }
+  }
+}

bona1122/[week3]Queue/Truck_on_bridge.js

@@ -0,0 +1,59 @@
+// https://school.programmers.co.kr/learn/courses/30/lessons/42583
+
+// 방법 1: 공간 관점 풀이(다리를 배열로 표현하여 물리적 공간을 시뮬레이션)
+function solution1(bridge_length, weight, truck_weights) {
+  // 다리의 전체 칸을 0으로 초기화 (각 칸이 다리의 실제 위치를 표현)
+  const bridge = Array(bridge_length).fill(0);
+  let current_weight = 0;
+  let time = 0;
+
+  while (truck_weights.length > 0 || current_weight > 0) {
+    // 매 초마다 맨 앞 칸의 트럭(또는 0)을 제거하여 이동 표현
+    current_weight -= bridge.shift();
+
+    // 다리에 새 트럭을 진입시킬 수 있는지 확인
+    if (
+      truck_weights.length > 0 &&
+      current_weight + truck_weights[0] <= weight
+    ) {
+      const new_truck = truck_weights.shift();
+      bridge.push(new_truck);
+      current_weight += new_truck;
+    } else {
+      bridge.push(0); // 트럭이 진입할 수 없으면 빈 공간(0) 추가
+    }
+
+    time++;
+  }
+
+  return time;
+}
+
+// 방법 2: 시간 관점 풀이(각 트럭의 진입 시간을 기록하여 이동 시간을 계산)
+function solution2(bridge_length, weight, truck_weights) {
+  // 다리 위 트럭들의 [무게, 진입시간]을 저장하는 큐
+  const queue = [];
+  let time = 0;
+  let current_weight = 0;
+
+  while (truck_weights.length > 0 || queue.length > 0) {
+    time++;
+
+    // 선두 트럭의 이동 시간이 다리 길이와 같아지면 다리에서 제거
+    if (queue.length > 0 && time - queue[0][1] === bridge_length) {
+      current_weight -= queue.shift()[0];
+    }
+
+    // 새 트럭의 진입 시간과 무게를 큐에 기록
+    if (
+      truck_weights.length > 0 &&
+      current_weight + truck_weights[0] <= weight
+    ) {
+      const truck = truck_weights.shift();
+      queue.push([truck, time]);
+      current_weight += truck;
+    }
+  }
+
+  return time;
+}