Merge branch 'main' into 24-yuyu0830

InSange/BFS/310_Minimum Height Trees.cpp

@@ -0,0 +1,66 @@
+#include <vector>
+#include <map>
+#include <queue>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<int> findMinHeightTrees(int n, vector<vector<int>>& edges) {
+        map<int, vector<int>> m;
+        vector<int> ans;
+        vector<bool> check(n, false);
+        int* degree = new int[n] {0};
+
+        for (vector<int> node : edges)
+        {
+            m[node[0]].push_back(node[1]);
+            m[node[1]].push_back(node[0]);
+            degree[node[0]]++;
+            degree[node[1]]++;
+        }
+        int current_n = n;
+
+        queue<int> q;
+        if (current_n > 2)
+        {
+            for (int i = 0; i < n; i++)
+            {
+                if (degree[i] == 1 && check[i] == false)
+                {
+                    check[i] = true;
+                    q.push(i);
+                    current_n--;
+                }
+            }
+        }
+        while (current_n > 2 && !q.empty())
+        {
+            int size = q.size();
+
+            for (int j = 0; j < size; j++)
+            {
+                int remove_n = q.front();
+                q.pop();
+
+                for (auto node : m[remove_n])
+                {
+                    degree[node]--;
+                    if (degree[node] == 1)
+                    {
+                        q.push(node);
+                        check[node] = true;
+                        current_n--;
+                    }
+                }
+            }
+        }
+
+        for (int i = 0; i < n; i++)
+        {
+            if (check[i] == false) ans.push_back(i);
+        }
+
+        return ans;
+    }
+};

InSange/README.md

@@ -26,6 +26,8 @@
 | 22차시 | 2024.07.31 |  DP  | [Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/)  | [#22](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/81)]
 | 23차시 | 2024.08.03 |  슬라이딩 윈도우  | [Minimum Swaps to Group All 1's Together 2](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)  | [#23](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/82)]
 | 24차시 | 2024.08.04 |  BFS  | [트리](https://www.acmicpc.net/problem/1068)  | [#24](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/83)]
+| 25차시 | 2024.08.10 |  BFS  | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)  | [#25](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/87)]
+| 26차시 | 2024.08.11 |  수학  | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/)  | [#26](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/89)]
 ---
 
 https://leetcode.com/problems/robot-collisions/

InSange/수학/840_Magic Squares In Grid.cpp

@@ -0,0 +1,55 @@
+#include <vector>
+
+using namespace std;
+
+class Solution {
+public:
+    bool Check(int r, int c, vector<vector<int>>& grid)
+    {
+        vector<bool> isCheck(10, false);
+
+        for (int i = 0; i < 3; i++)
+        {
+            for (int j = 0; j < 3; j++)
+            {
+                int num = grid[r + i][c + j];
+                if (num < 1 || num > 9) return false;
+                if (isCheck[num]) return false;
+                isCheck[num] = true;
+            }
+        }
+
+        int standard_num = grid[r][c] + grid[r + 1][c + 1] + grid[r + 2][c + 2];
+        if (standard_num != grid[r][c + 2] + grid[r + 1][c + 1] + grid[r + 2][c]) return false;
+
+        for (int i = 0; i < 3; i++)
+        {
+            if (standard_num != (grid[r + i][c] + grid[r + i][c + 1] + grid[r + i][c + 2])) return false;
+        }
+
+        for (int i = 0; i < 3; i++)
+        {
+            if (standard_num != (grid[r][c + i] + grid[r + 1][c + i] + grid[r + 2][c + i])) return false;
+        }
+
+        return true;
+    }
+
+    int numMagicSquaresInside(vector<vector<int>>& grid) {
+        int col = grid[0].size(), row = grid.size();
+
+        if (col < 3 || row < 3) return 0;
+
+        int ans = 0;
+
+        for (int i = 0; i < row - 2; i++)
+        {
+            for (int j = 0; j < col - 2; j++)
+            {
+                if (Check(i, j, grid)) ans++;
+            }
+        }
+
+        return ans;
+    }
+};

seongwon030/README.md

@@ -1,22 +1,30 @@
 ## ✏️ 기록
 
-|  차시  |    날짜    |  문제유형  |                          링크                           |                           풀이                            |
-| :----: | :--------: | :--------: | :-----------------------------------------------------: | :-------------------------------------------------------: |
-| 1차시  | 2024.03.11 |    스택    |    [쇠막대기](https://www.acmicpc.net/problem/10799)    |  [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/2)  |
-| 2차시  | 2024.03.16 |    BFS     |     [토마토](https://www.acmicpc.net/problem/7576)      |  [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/7)  |
-| 3차시  | 2024.03.19 |    BFS     |   [3차원토마토](https://www.acmicpc.net/problem/7569)   | [#3](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/11)  |
-| 4차시  | 2024.03.25 |    BFS     |   [숨바꼭질3](https://www.acmicpc.net/problem/13549)    |  [#4](https://github.com/AlgoLeadMe/AlgoLeadMe8/pull/16)  |
-| 5차시  | 2024.03.30 |    BFS     |    [점프점프](https://www.acmicpc.net/problem/11060)    | [#5](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/23)  |
-| 6차시  | 2024.04.02 |    스택    |   [문자열폭발](https://www.acmicpc.net/problem/9935)    | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/25)  |
-| 7차시  | 2024.04.05 |    스택    |     [오큰수](https://www.acmicpc.net/problem/17298)     | [#7](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/30)  |
-| 8차시  | 2024.04.12 |    BFS     |     [결혼식](https://www.acmicpc.net/problem/5567)      | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/37)  |
-| 9차시  | 2024.04.29 |     DP     | [1,2,3 더하기 3](https://www.acmicpc.net/problem/15988) | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/38)  |
-| 10차시 | 2024.05.07 |    수학    |     [연속 합](https://www.acmicpc.net/problem/2737)     | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/43) |
-| 11차시 | 2024.05.07 |     DP     |     [합분해](https://www.acmicpc.net/problem/2225)      | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/44) |
-| 12차시 | 2024.05.13 | 브루트포스 |   [암호만들기](https://www.acmicpc.net/problem/1759)    | [#12](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/50) |
-| 13차시 | 2024.05.23 |  분할정복  | [피보나치 수 6](https://www.acmicpc.net/problem/11444)  | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/55) |
-| 14차시 | 2024.05.28 |     큐     | [가운데를 말해요](https://www.acmicpc.net/problem/1655) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/58) |
-| 15차시 | 2024.06.01 |     큐     |  [중앙값 구하기](https://www.acmicpc.net/problem/2696)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/61) |
-| 16차시 | 2024.07.04 |     DP     |     [연속합](https://www.acmicpc.net/problem/1912)      | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/66) |
+|  차시  |    날짜    |    문제유형    |                          링크                           |                           풀이                            |
+| :----: | :--------: | :------------: | :-----------------------------------------------------: | :-------------------------------------------------------: |
+| 1차시  | 2024.03.11 |      스택      |    [쇠막대기](https://www.acmicpc.net/problem/10799)    |  [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/2)  |
+| 2차시  | 2024.03.16 |      BFS       |     [토마토](https://www.acmicpc.net/problem/7576)      |  [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/7)  |
+| 3차시  | 2024.03.19 |      BFS       |   [3차원토마토](https://www.acmicpc.net/problem/7569)   | [#3](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/11)  |
+| 4차시  | 2024.03.25 |      BFS       |   [숨바꼭질3](https://www.acmicpc.net/problem/13549)    |  [#4](https://github.com/AlgoLeadMe/AlgoLeadMe8/pull/16)  |
+| 5차시  | 2024.03.30 |      BFS       |    [점프점프](https://www.acmicpc.net/problem/11060)    | [#5](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/23)  |
+| 6차시  | 2024.04.02 |      스택      |   [문자열폭발](https://www.acmicpc.net/problem/9935)    | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/25)  |
+| 7차시  | 2024.04.05 |      스택      |     [오큰수](https://www.acmicpc.net/problem/17298)     | [#7](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/30)  |
+| 8차시  | 2024.04.12 |      BFS       |     [결혼식](https://www.acmicpc.net/problem/5567)      | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/37)  |
+| 9차시  | 2024.04.29 |       DP       | [1,2,3 더하기 3](https://www.acmicpc.net/problem/15988) | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/38)  |
+| 10차시 | 2024.05.07 |      수학      |     [연속 합](https://www.acmicpc.net/problem/2737)     | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/43) |
+| 11차시 | 2024.05.07 |       DP       |     [합분해](https://www.acmicpc.net/problem/2225)      | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/44) |
+| 12차시 | 2024.05.13 |   브루트포스   |   [암호만들기](https://www.acmicpc.net/problem/1759)    | [#12](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/50) |
+| 13차시 | 2024.05.23 |    분할정복    | [피보나치 수 6](https://www.acmicpc.net/problem/11444)  | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/55) |
+| 14차시 | 2024.05.28 |       큐       | [가운데를 말해요](https://www.acmicpc.net/problem/1655) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/58) |
+| 15차시 | 2024.06.01 |       큐       |  [중앙값 구하기](https://www.acmicpc.net/problem/2696)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/61) |
+| 16차시 | 2024.07.04 |       DP       |     [연속합](https://www.acmicpc.net/problem/1912)      | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/66) |
+| 17차시 | 2024.07.05 | 최소스패닝트리 | [최소스패닝트리](https://www.acmicpc.net/problem/1197)  | [#17](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/67) |
+| 18차시 | 2024.07.08 | 최소스패닝트리 |     [정복자](https://www.acmicpc.net/problem/14950)     | [#18](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/69) |
+| 19차시 | 2024.07.14 | 최소스패닝트리 |     [전력난](https://www.acmicpc.net/problem/6497)      | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/73) |
+| 20차시 | 2024.07.22 |  유니온파인드  |   [집합의표현 ](https://www.acmicpc.net/problem/1717)   | [#20](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/76) |
+| 21차시 | 2024.07.24 |      DFS       |      [트리](https://www.acmicpc.net/problem/1068)       | [#21](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/78) |
+| 22차시 | 2024.07.30 |      DFS       |     [알파벳](https://www.acmicpc.net/problem/1987)      | [#22](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/80) |
+| 23차시 | 2024.08.05 |      DFS       |      [게임](https://www.acmicpc.net/problem/1103)       | [#23](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/85) |
+| 24차시 | 2024.08.10 |      구현      |  [주사위굴리기](https://www.acmicpc.net/problem/14499)  | [#24](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/66) |
 
 ---

seongwon030/구현/주사위굴리기.py

@@ -0,0 +1,58 @@
+import sys
+input = sys.stdin.readline
+
+n,m,x,y,k = map(int,input().split())
+arr = []
+for _ in range(n):
+  arr.append(list(map(int,input().split())))
+
+move = list(map(int,input().split()))
+
+# 주사위 (서,북,윗면,오,남,아랫면) 초기값
+dice = [0]*6
+# k=1, 동쪽으로 이동
+# k=2, 서쪽으로 이동
+# k=3, 북쪽으로 이동
+# k=4, 남쪽으로 이동
+
+for i in move:
+  if i == 1: # 동 
+    if y+1 < m:
+      y+=1
+      dice[0],dice[2],dice[3],dice[5] =  dice[5],dice[0],dice[2],dice[3]
+      print(dice[2])
+      if arr[x][y] == 0:
+        arr[x][y] = dice[5]
+      else:
+        dice[5] = arr[x][y]
+        arr[x][y] = 0
+  elif i == 2: # 서
+    if y-1 >=0:
+      y-=1
+      dice[0],dice[2],dice[3],dice[5] = dice[2],dice[3],dice[5],dice[0]
+      print(dice[2])
+      if arr[x][y] == 0:
+        arr[x][y] = dice[5]
+      else:
+        dice[5] = arr[x][y]
+        arr[x][y] = 0
+  elif i == 3: # 북
+    if x-1 >=0:
+      x-=1
+      dice[1],dice[2],dice[4],dice[5] = dice[2],dice[4],dice[5],dice[1]
+      print(dice[2])
+      if arr[x][y] == 0:
+        arr[x][y] = dice[5]
+      else:
+        dice[5] = arr[x][y]
+        arr[x][y] = 0
+  elif i == 4: # 남
+    if x+1 < n:
+      x+=1
+      dice[1],dice[2],dice[4],dice[5] = dice[5],dice[1],dice[2],dice[4]
+      print(dice[2])
+      if arr[x][y] == 0:
+        arr[x][y] = dice[5]
+      else:
+        dice[5] = arr[x][y]
+        arr[x][y] = 0

yuyu0830/DP/1562.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+
+#define MOD 1000000000
+
+using namespace std;
+
+int arr[101][10][1024] = {0, };
+
+int main() {
+    int n; cin >> n;
+
+    for (int i = 1; i < 10; i++) {
+        arr[1][i][1 << i] = 1;
+    }
+
+    for (int i = 2; i <= n; i++) {
+        for (int j = 0; j < 10; j++) {
+            for (int k = 0; k < 1024; k++) {
+                if (j) {
+                    arr[i][j][k | (1 << j)] += arr[i - 1][j - 1][k];
+                    arr[i][j][k | (1 << j)] %= MOD;
+                } 
+
+                if (j != 9) {
+                    arr[i][j][k | (1 << j)] += arr[i - 1][j + 1][k];
+                    arr[i][j][k | (1 << j)] %= MOD;
+                }
+            }
+        }
+    }
+
+    int ans = 0;
+
+    for (int i = 0; i < 10; i++) {
+        ans += arr[n][i][1023];
+        ans %= MOD;
+    }
+
+    printf("%d\n", ans);
+}

yuyu0830/LCS/9252.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+int arr[1001][1001] = {0, };
+string str1, str2;
+
+void print(int x, int y) {
+    if (!arr[x][y]) return;
+
+    if (str1[x - 1] == str2[y - 1]) {
+        print(x - 1, y - 1);
+        printf("%c", str1[x - 1]);
+        return;
+    }
+
+    arr[x - 1][y] > arr[x][y - 1] ? print(x - 1, y) : print(x, y - 1);
+}
+
+int main() {
+    cin >> str1 >> str2;
+
+    int len1 = str1.size(), len2 = str2.size();
+
+    for (int i = 0; i <= len1; i++) {
+        for (int j = 0; j <= len2; j++) {
+            if (!i || !j) arr[i][j] = 0;
+            else if (str1[i - 1] == str2[j - 1]) arr[i][j] = arr[i - 1][j - 1] + 1;
+            else arr[i][j] = max(arr[i][j - 1], arr[i - 1][j]);
+        }
+    }
+
+    printf("%d\n", arr[len1][len2]);
+    print(len1, len2);
+}

yuyu0830/README.md

@@ -23,5 +23,7 @@
 | 19차시 | 2024.07.12 |  재귀  | [우수마을](https://www.acmicpc.net/problem/1949)  | - |
 | 20차시 | 2024.07.22 |  LIS  | [가장 긴 증가하는 부분 수열 5](https://www.acmicpc.net/problem/14003)  | - |
 | 21차시 | 2024.07.23 |  수학  | [1의 개수 세기](https://www.acmicpc.net/problem/9527)  | - |
+| 22차시 | 2024.08.05 |  DP  | [계단 수](https://www.acmicpc.net/problem/1562)  | - |
+| 23차시 | 2024.08.05 |  LCS  | [LCS 2](https://www.acmicpc.net/problem/9252)  | - |
 | 24차시 | 2024.08.14 |  위상정렬  | [줄 세우기](https://www.acmicpc.net/problem/2252)  | - |
 ---