Merge pull request #647 from jinoo0306/main

[조진우] 96차 라이브 코테 제출

Author: github-actions[bot]

live9/test96/문제1/조진우.js

@@ -0,0 +1,32 @@
+function solution(board) {
+  const h = board.length;
+  const w = board[0].length;
+  const map = board.map((row) => row.split(""));
+
+  let startX = -1;
+  let startY = -1;
+
+  for (let i = 0; i < h; i++) {
+    for (let j = 0; j < w; j++) {
+      if (map[i][j] === "R") {
+        startX = i;
+        startY = j;
+        break;
+      }
+    }
+  }
+
+  const visited = Array.from({ length: h }, () => Array(w).fill(false));
+  visited[startX][startY] = true;
+
+  const queue = [];
+  queue.push([startX, startY]);
+
+  while (queue.length) {
+    const [x, y] = queue.shift();
+    for (let dir = 0; dir < 4; dir++) {}
+  }
+
+  var answer = -1;
+  return answer;
+}

live9/test96/문제2/조진우.js

@@ -0,0 +1,20 @@
+function solution(n) {
+  let ways = 0;
+  let startNum = 1;
+  while (startNum <= n) {
+    let sum = 0;
+    let i = startNum;
+    while (true) {
+      if (sum > n) break;
+
+      if (sum === n) {
+        ways++;
+        break;
+      }
+      sum = sum + i;
+      i++;
+    }
+    startNum++;
+  }
+  return ways;
+}

live9/test96/문제3/조진우.js

@@ -0,0 +1,18 @@
+function solution(elements) {
+  const n = elements.length;
+  const sums = new Set();
+
+  for (let i = 1; i <= n; i++) {
+    for (let j = 0; j < n; j++) {
+      let sum = 0;
+      for (let k = 0; k < i; k++) {
+        sum += elements[(j + k) % n];
+      }
+      sums.add(sum);
+    }
+  }
+
+  return sums.size;
+}
+
+console.log(solution([7, 9, 1, 1, 4]));