Skip to content

Commit 1c4f077

Browse files
github-actions[bot]github-actions[bot]
committed
chore: auto update READMEs
1 parent c04deeb commit 1c4f077

2 files changed

Lines changed: 5 additions & 5 deletions

File tree

‎BaekJoon/README.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -312,7 +312,7 @@
312312
| 1003 | [ACM Craft](https://www.acmicpc.net/problem/1005) | III | DP, Graph, Topological Sort | [O(V+E)/O(V+E)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1005.java) | |
313313
| 1038 | [감소하는 수](https://www.acmicpc.net/problem/1038) | V | Brute Force, Backtracking | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1038.java) | |
314314
| 1043 | [거짓말](https://www.acmicpc.net/problem/1043) | IV | Data Structure, Graph Theory, Graph Traversal, Disjoint Set | [O(N+M)/O(N+M)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/1043.java) | |
315-
| 1062 | [가르침](https://www.acmicpc.net/problem/1062) | IV | Brute Force, Bit Masking, Backtracking | [O()/O()](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1062.java) | 백트래킹은 항상 예외 케이스들을 잘 생각하고 조건 처리하자. |
315+
| 1062 | [가르침](https://www.acmicpc.net/problem/1062) | IV | Brute Force, Bit Masking, Backtracking | [O()/O()](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1062.java) | 백트래킹은 항상 예외 케이스들을 잘 생각하고 조건 처리하자. |
316316
| 1167 | [트리의 지름](https://www.acmicpc.net/problem/1167) | III | Graph, Tree, DFS | [O(V+E)/O(V+E)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1167.java) | 트리지름 구하기 테크닉 기억하자. (동일한 문제 : 1967) |
317317
| 1194 | [달이 차오른다, 가자.](https://www.acmicpc.net/problem/1194) | I | Graph, Bit Masking, BFS | [O()/O()](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1194.java) | |
318318
| 1197 | [최소 스패닝 트리](https://www.acmicpc.net/problem/1197) | IV | Graph, MST | [O(ElogE)/O(V+E)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_1197.java) | |
@@ -439,17 +439,17 @@
439439
| 11780 | [플로이드 2](https://www.acmicpc.net/problem/11780) | III | Floyd-Warshall, Graph | [O(N^3)/O(N^2)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_11780.java) | 2차원 배열 사용해서 경로 추적 |
440440
| 12015 | [가장 긴 증가하는 부분 수열 2](https://www.acmicpc.net/problem/12015) | II | Binary Search, LIS | [O(NlogN)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_12015.java) | |
441441
| 12100 | [2048 (Easy)](https://www.acmicpc.net/problem/12100) | II | Implementation, Brute Force | [O()/O()](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_12100.java) | |
442-
| 12865 | [평범한 배낭](https://www.acmicpc.net/problem/12865) | V | DP, Knapsack | [O(N\*K)/O(N\*K)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_12865.java) | Knapsack |
443442
| 12837 | [가계부 (Hard)](https://www.acmicpc.net/problem/12837) | I | Data Structure, Segment Tree | [O(NlogN)/O(2^(logN+1))](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_12837.java) | |
443+
| 12865 | [평범한 배낭](https://www.acmicpc.net/problem/12865) | V | DP, Knapsack | [O(N\*K)/O(N\*K)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_12865.java) | Knapsack |
444444
| 12904 | [A와 B](https://www.acmicpc.net/problem/12904) | V | Implementation, Greedy, String | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_12904.java) | 반대로 생각할 수 있는 사고 기르기. |
445445
| 13023 | [ABCDE](https://www.acmicpc.net/problem/13023) | V | Graph Theroy, Graph Traversal, DFS, Backtracking | [O(N*M)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13023.java) | |
446446
| 13144 | [List of Unique Numbers](https://www.acmicpc.net/problem/13144) | III | Two Pointer | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13144.java) | |
447447
| 13244 | [Tree](https://www.acmicpc.net/problem/13244) | III | Graph, Data Structure, Tree, String, Disjoint Set | [O(N)/O(N+M)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13244.java) | |
448-
| 13424 | [비밀 모임](https://www.acmicpc.net/problem/13424) | V | Graph, Dijkstra, Floyd-Warshall | [O(N^3)/O(N^2)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13424.java) | |
449448
| 13398 | [연속합 2](https://www.acmicpc.net/problem/13398) | V | DP, Prefix Sum | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13398.java) | |
450449
| 13418 | [학교 탐방하기](https://www.acmicpc.net/problem/13418) | III | Graph, MST | [O(MlogM)/O(N+M)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13418.java) | |
450+
| 13424 | [비밀 모임](https://www.acmicpc.net/problem/13424) | V | Graph, Dijkstra, Floyd-Warshall | [O(N^3)/O(N^2)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13424.java) | |
451451
| 13460 | [구슬 탈출 2](https://www.acmicpc.net/problem/13460) | II | Implementation, Graph, BFS, Brute Force | [O()/O()](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13460.java) | |
452-
| 13549 | [숨바꼭질 3](https://www.acmicpc.net/problem/13549) | V | Graph, Data Structure, BFS, Dijkstra, 0-1 BFS | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13549.java) |
452+
| 13549 | [숨바꼭질 3](https://www.acmicpc.net/problem/13549) | V | Graph, Data Structure, BFS, Dijkstra, 0-1 BFS | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13549.java) |
453453
| 13913 | [숨바꼭질 4](https://www.acmicpc.net/problem/13913) | IV | Graph, BFS | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13913.java) | 경로 추적하는 방법 기억하고 경로를 요구할 때 적절하게 사용하자. |
454454
| 13975 | [파일 합치기 3](https://www.acmicpc.net/problem/13975) | V | Greedy, Data Structure, Priority Queue | [O(KlogK)/O(K)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_13975.java) | |
455455
| 14002 | [가장 긴 증가하는 부분 수열 4](https://www.acmicpc.net/problem/14002) | IV | DP | [O(NlogN)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/BaekJoon/Solutions/Solution_14002.java) | LIS 인덱스 얻기 |

‎LeetCode/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -45,7 +45,7 @@
4545
| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | Array, DP | [O(N\*M)/O(M)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_UniquePathsII.java) | 유사한 문제 : [등굣길](https://programmers.co.kr/learn/courses/30/lessons/42898) |
4646
| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | Array, DP | [O(M\*N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_MinimumPathSum.java) | |
4747
| 66 | [Plus One](https://leetcode.com/problems/plus-one/) | Easy | Array | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_PlusOne.java) | |
48-
| 67 | [Add Binary](https://leetcode.com/problems/add-binary/) | Easy | Math, String, Bit Manipulation, Simulation | [O(N)/O(1)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_AddBinary.java) | |
48+
| 67 | [add binary](https://leetcode.com/problems/add-binary/) | Easy | Math, String, Bit Manipulation, Simulation | [O(N)/O(1)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_AddBinary.java) | */ |
4949
| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx/) | Easy | Math, Binary Search | [O(logN)/O(1)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_Sqrt_x.java) | |
5050
| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | DP | [O(N)/O(N)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_ClimbingStairs.java) | |
5151
| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | Hard | String, DP | [O(N\*M)/O(N\*M)](https://github.com/SubAkBa/Algorithm_Solution/blob/master/LeetCode/Solutions/Solution_EditDistance.java) | Levenshtein |

0 commit comments

Comments
 (0)