[moonjonghoo]25.02.20

.vscode/launch.json

@@ -0,0 +1,15 @@
+{
+    // IntelliSense를 사용하여 가능한 특성에 대해 알아보세요.
+    // 기존 특성에 대한 설명을 보려면 가리킵니다.
+    // 자세한 내용을 보려면 https://go.microsoft.com/fwlink/?linkid=830387을(를) 방문하세요.
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "type": "chrome",
+            "request": "launch",
+            "name": "localhost에 대해 Chrome 시작",
+            "url": "http://localhost:8080",
+            "webRoot": "${workspaceFolder}"
+        }
+    ]
+}

Moonjonghoo/graph/DFS와_BFS.js

@@ -0,0 +1,35 @@
+const fs = require("fs");
+const input = fs.readFileSync("/dev/stdin").toString().trim().split("\n");
+
+const [N, M, V] = input[0].split(" ").map(Number);
+const edges = input.slice(1).map((line) => line.split(" ").map(Number));
+
+const graph = Array.from({ length: N + 1 }, () => []);
+edges.forEach(([a, b]) => {
+  graph[a].push(b);
+  graph[b].push(a);
+});
+graph.forEach((node) => node.sort((a, b) => a - b));
+
+const dfs = (v, visited = []) => {
+  if (visited.includes(v)) return;
+  visited.push(v);
+  graph[v].forEach((n) => dfs(n, visited));
+  return visited;
+};
+
+const bfs = (v) => {
+  let queue = [v],
+    visited = [];
+  while (queue.length) {
+    let node = queue.shift();
+    if (!visited.includes(node)) {
+      visited.push(node);
+      queue.push(...graph[node].filter((n) => !visited.includes(n)));
+    }
+  }
+  return visited;
+};
+
+console.log(dfs(V, []).join(" "));
+console.log(bfs(V).join(" "));

Moonjonghoo/graph/게임_맵_최단거리.js

@@ -0,0 +1,34 @@
+function solution(maps) {
+  let n = maps.length;
+  let m = maps[0].length;
+  let answer = 1;
+  let visited = maps;
+  const dx = [-1, 1, 0, 0];
+  const dy = [0, 0, -1, 1];
+  let queue = [];
+  queue.push([0, 0]);
+  visited[0][0] = 0;
+
+  while (queue.length > 0) {
+    let size = queue.length;
+
+    for (let i = 0; i < size; i++) {
+      let [x, y] = queue.shift();
+
+      for (let j = 0; j < 4; j++) {
+        let nx = x + dx[j];
+        let ny = y + dy[j];
+
+        if (nx >= 0 && nx < n && ny >= 0 && ny < m && visited[nx][ny] === 1) {
+          if (nx == n - 1 && ny == m - 1) {
+            return ++answer;
+          }
+          queue.push([nx, ny]);
+          visited[nx][ny] = 0;
+        }
+      }
+    }
+    answer++;
+  }
+  return -1;
+}

Moonjonghoo/graph/전력망을_둘로_나누기.js

@@ -0,0 +1,48 @@
+function solution(n, wires) {
+  let answer = Infinity;
+
+  function dfs(graph, start, visited) {
+    visited[start] = true;
+    let count = 1;
+
+    for (let i = 0; i < graph[start].length; i++) {
+      const neighbor = graph[start][i];
+      if (!visited[neighbor]) {
+        count += dfs(graph, neighbor, visited);
+      }
+    }
+
+    return count;
+  }
+
+  for (let i = 0; i < n - 1; i++) {
+    const graph = Array(n)
+      .fill(null)
+      .map(() => []);
+    for (let j = 0; j < n - 1; j++) {
+      if (i === j) continue;
+      const [a, b] = wires[j];
+      graph[a - 1].push(b - 1);
+      graph[b - 1].push(a - 1);
+    }
+
+    const visited = Array(n).fill(false);
+    let count1 = 0;
+    let count2 = 0;
+
+    for (let j = 0; j < n; j++) {
+      if (!visited[j]) {
+        if (count1 === 0) {
+          count1 = dfs(graph, j, visited);
+        } else {
+          count2 = dfs(graph, j, visited);
+        }
+      }
+    }
+
+    const diff = Math.abs(count1 - count2);
+    answer = Math.min(answer, diff);
+  }
+
+  return answer;
+}

Moonjonghoo/graph/타겟_넘버.js

@@ -0,0 +1,25 @@
+function solution(numbers, target) {
+  let n = numbers.length;
+  let check = Array.from({ length: n }, () => false);
+  let answer = 0;
+  function DFS(v) {
+    if (v === n) {
+      let sum = 0;
+      for (let i = 0; i < n; i++) {
+        if (check[i] === true) {
+          sum += numbers[i];
+        } else if (check[i] === false) {
+          sum -= numbers[i];
+        }
+      }
+      if (sum === target) answer++;
+    } else {
+      check[v] = true;
+      DFS(v + 1);
+      check[v] = false;
+      DFS(v + 1);
+    }
+  }
+  DFS(0);
+  return answer;
+}

Moonjonghoo/hash/A로 B만들기.js

@@ -0,0 +1,28 @@
+function solution(before, after) {
+  let hash1 = new Map();
+  let hash2 = new Map();
+
+  for (let i = 0; i < before.length; i++) {
+    hash1.set(before[i], (hash1.get(before[i]) || 0) + 1);
+    hash2.set(after[i], (hash2.get(after[i]) || 0) + 1);
+  }
+
+  // Map 비교 함수
+  function compareMaps(map1, map2) {
+    if (map1.size !== map2.size) return false; // 크기 비교
+    for (let [key, value] of map1) {
+      if (map2.get(key) !== value) return false; // 키-값 비교
+    }
+    return true;
+  }
+
+  // 비교 결과 반환
+  return compareMaps(hash1, hash2) ? 1 : 0;
+}
+
+console.log(solution("olleh", "hello")); // 1
+console.log(solution("apple", "ppale")); // 0
+
+console.log(solution("olleh", "hello"));
+
+//바꿀수있다는것은 구성 요소의 종류와 개수가 같으면됩니다.

Moonjonghoo/hash/등수 매기기.js

@@ -0,0 +1,10 @@
+function solution(score) {
+  // 각 학생의 평균 점수 계산
+  const averages = score.map(([eng, math]) => (eng + math) / 2);
+
+  // 평균 점수를 내림차순으로 정렬하여 등수 매기기
+  const sorted = [...averages].sort((a, b) => b - a);
+
+  // 원래 평균 점수 배열의 각 값이 정렬된 배열에서 몇 번째 순위인지 계산
+  return averages.map((avg) => sorted.indexOf(avg) + 1);
+}

Moonjonghoo/hash/모스부호(1).js

@@ -0,0 +1,41 @@
+function solution(letter) {
+  var answer = "";
+  let morse = {
+    ".-": "a",
+    "-...": "b",
+    "-.-.": "c",
+    "-..": "d",
+    ".": "e",
+    "..-.": "f",
+    "--.": "g",
+    "....": "h",
+    "..": "i",
+    ".---": "j",
+    "-.-": "k",
+    ".-..": "l",
+    "--": "m",
+    "-.": "n",
+    "---": "o",
+    ".--.": "p",
+    "--.-": "q",
+    ".-.": "r",
+    "...": "s",
+    "-": "t",
+    "..-": "u",
+    "...-": "v",
+    ".--": "w",
+    "-..-": "x",
+    "-.--": "y",
+    "--..": "z",
+  };
+
+  let arr = letter.split(" ");
+  for (let i = 0; i < arr.length; i++) {
+    if (morse.hasOwnProperty(arr[i])) {
+      answer += morse[arr[i]];
+    }
+  }
+  return answer;
+}
+
+console.log(solution(".... . .-.. .-.. ---"));

Moonjonghoo/hash/진료순서.js

@@ -0,0 +1,16 @@
+function solution(emergency) {
+  var answer = [];
+  let newarr = emergency.slice();
+  newarr.sort((a, b) => b - a);
+  let map = new Map();
+  for (let i = 0; i < newarr.length; i++) {
+    map.set(newarr[i], i + 1);
+  }
+  for (let i = 0; i < emergency.length; i++) {
+    let number = map.get(emergency[i]);
+    answer.push(number);
+  }
+  return answer;
+}
+
+console.log(solution([3, 76, 24]));

Moonjonghoo/queue/로그인_성공.js

@@ -0,0 +1,11 @@
+function solution(id_pw, db) {
+  const [id, pw] = id_pw;
+
+  for (const [dbId, dbPw] of db) {
+    if (id === dbId) {
+      return pw === dbPw ? "login" : "wrong pw";
+    }
+  }
+
+  return "fail";
+}

Moonjonghoo/queue/순서쌍의_개수.js

@@ -0,0 +1,14 @@
+function solution(n) {
+  let count = 0;
+
+  for (let i = 1; i <= Math.sqrt(n); i++) {
+    if (n % i === 0) {
+      count++; // i가 약수
+      if (i !== n / i) {
+        count++; // i가 n의 제곱근이 아니면 나머지 짝도 추가
+      }
+    }
+  }
+
+  return count;
+}

Moonjonghoo/queue/점의_위치_구하기.js

@@ -0,0 +1,8 @@
+function solution(dot) {
+  const [x, y] = dot;
+
+  if (x > 0 && y > 0) return 1; // 1사분면
+  if (x < 0 && y > 0) return 2; // 2사분면
+  if (x < 0 && y < 0) return 3; // 3사분면
+  if (x > 0 && y < 0) return 4; // 4사분면
+}

Moonjonghoo/queue/특이한_정렬.js

@@ -0,0 +1,11 @@
+function solution(numlist, n) {
+  return numlist.sort((a, b) => {
+    const diffA = Math.abs(a - n);
+    const diffB = Math.abs(b - n);
+
+    if (diffA === diffB) {
+      return b - a; 
+    }
+    return diffA - diffB; 
+  });
+}

Moonjonghoo/queue/프로세스.js

@@ -0,0 +1,17 @@
+function solution(priorities, location) {
+  let order = 0;
+
+  while (priorities.length > 0) {
+    const current = priorities.shift();
+    if (priorities.some((priority) => priority > current)) {
+      priorities.push(current);
+      location = location === 0 ? priorities.length - 1 : location - 1;
+    } else {
+      order++;
+      if (location === 0) {
+        return order; // 목표 프로세스가 실행되었을 때 순서를 반환
+      }
+      location--;
+    }
+  }
+}

Moonjonghoo/set/Contains_Duplicate.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var containsDuplicate = function (nums) {
+  let hash = new Set();
+  for (let i = 0; i < nums.length; i++) {
+    if (!hash.has(nums[i])) {
+      hash.add(nums[i]);
+    }
+  }
+  if (hash.size !== nums.length) return true;
+  else {
+    return false;
+  }
+};

Moonjonghoo/set/Intersection_of_two_arrays.js

@@ -0,0 +1,12 @@
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+var intersection = function (nums1, nums2) {
+  let hash = new Set(nums2);
+  const intersectionSet = new Set([...nums1].filter((x) => hash.has(x)));
+  return [...intersectionSet];
+};
+
+console.log(intersection([1, 2, 2, 1], [2, 2]));

Moonjonghoo/set/count_the_number_of_consistent_strings.js

@@ -0,0 +1,21 @@
+/**
+ * @param {string} allowed
+ * @param {string[]} words
+ * @return {number}
+ */
+var countConsistentStrings = function (allowed, words) {
+  let hash = new Set(allowed.split(""));
+  let answer = words.length;
+  console.log(hash);
+  for (let i = 0; i < words.length; i++) {
+    for (let j = 0; j < words[i].length; j++) {
+      if (!hash.has(words[i][j])) {
+        answer--;
+        break;
+      }
+    }
+  }
+  return answer;
+};
+
+console.log(countConsistentStrings("ab", ["ad", "bd", "aaab", "baa", "badab"]));