diff --git a/Concept/New/00_Special/Pythonic_Code_For_Coding_Test.md b/Concept/New/00_Special/Pythonic_Code_For_Coding_Test.md index 2407b64..ac12709 100644 --- a/Concept/New/00_Special/Pythonic_Code_For_Coding_Test.md +++ b/Concept/New/00_Special/Pythonic_Code_For_Coding_Test.md @@ -615,6 +615,45 @@ Counter('hello world').most_common(2) # [('l', 3), ('o', 2)] `most_common()`을 사용하면 전체 결과를 튜플의 리스트로 리턴하고, 숫자를 명시하면 상위 n개에 해당하는 결과만 출력합니다. +### 배열 회전하기 + +코테에서 다양한 구현 문제를 풀다보면, 생각보다 귀찮은 친구가 여러가지 있습니다. 그 중 가장 귀찮을 수 있는 것은 바로 **배열 회전하기**죠? + +예를 들어, 다음과 같은 배열이 있다면, +|||| +|---|---|---| +|1|2|3| +|4|5|6| +|7|8|9| + +다음과 같이 회전하는거죠. + +|||| +|---|---|---| +|7|4|1| +|8|5|2| +|9|6|3| + +일반적으로 이런 문제를 해결하기 위해선, 이중 for문을 사용합니다. +하지만 놀랍게도 파이썬은 한 줄로 끝낼 수 있어요! + +```python +def rotate(arr): + return list(zip(*arr[::-1])) + +print(rotate([[1, 2, 3], [4, 5, 6], [7, 8, 9]])) +# [(7, 4, 1), (8, 5, 2), (9, 6, 3)] +``` + +아니 이게 어떻게 되는거죠? 차근 차근 알아보도록 해요. + +- 먼저, `arr[::-1]` 이므로 배열을 뒤집습니다. 이렇게 되면 `[[7, 8, 9], [4, 5, 6], [1, 2, 3]]` 이 됩니다. +- 이어서, *을 사용했으니 배열이 언패킹이 됩니다. 즉, `[7, 8, 9]`, `[4, 5, 6]`, `[1, 2, 3]` 으로 분리됩니다. +- 위의 세 배열에 대해 `zip()`을 수행합니다. 각각의 배열을 묶어주므로, `(7, 4, 1)`, `(8, 5, 2)`, `(9, 6, 3)` 이 됩니다. +- `zip()`의 반환값은 zip 객체이므로, 리스트로 변환해줍니다. + +과정은 복잡하지만, 코드는 정말 짧죠? + * * * Reference diff --git "a/Concept/New/02_Bruteforcing/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" "b/Concept/New/02_Bruteforcing/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" new file mode 100644 index 0000000..067869c Binary files /dev/null and "b/Concept/New/02_Bruteforcing/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" differ diff --git a/Concept/New/02_Bruteforcing/readme.md b/Concept/New/02_Bruteforcing/readme.md new file mode 100644 index 0000000..bd07358 --- /dev/null +++ b/Concept/New/02_Bruteforcing/readme.md @@ -0,0 +1,36 @@ +# 완전탐색, 백트래킹 +- 완전탐색 문제의 경우, 코드는 단순할 수 있지만 **어떻게 완전탐색 풀이가 나올 수 있는지** 판단하는 것이 제일 중요합니다. +- 백트래킹 문제의 경우, 재귀함수의 탈출 조건과 선택지의 회복을 고려하면서 코드를 설계하고, 작성해 보세요! + +## 수업 자료 내 문제 및 추천 문제 + +### 수업 자료 내 문제 + +|문제 이름|문제 링크|답안 코드 링크| +|---|---|---| +|영화감독 숌|[링크](http://boj.kr/1436)|[링크]()| +|퇴사|[링크](http://boj.kr/14501)|[링크]()| +|마인크래프트|[링크](http://boj.kr/18111)|[링크]()| +|N과 M (1)|[링크](http://boj.kr/15649)|[링크]()| +|N과 M (2)|[링크](http://boj.kr/15650)|[링크]()| +|N-Queen|[백준](http://boj.kr/9663) [프로그래머스](https://programmers.co.kr/learn/courses/30/lessons/12952)|[링크]()| +|감소하는 수|[링크](http://boj.kr/1038)|[링크]()| +|모든 순열|[링크](http://boj.kr/10974)|[링크]()| +|스타트와 링크|[링크](http://boj.kr/14889)|[링크]()| +|연산자 끼워넣기|[링크](http://boj.kr/14888)|[링크]()| + + +### 추천 문제 + +|문제 이름|문제 링크|답안 코드 링크| +|---|---|---| +|친구 팰린드롬|[링크](http://boj.kr/15270)|[링크]()| +|비밀번호|[링크](http://boj.kr/13908)|[링크]()| +|A와 B 2|[링크](http://boj.kr/12919)|[링크]()| +|리모컨|[링크](http://boj.kr/1107)|[링크]()| +|N과 M (9)|[링크](http://boj.kr/15663)|[링크]()| +|외판원 순회 2|[링크](http://boj.kr/10971)|[링크]()| +|스도쿠|[링크](http://boj.kr/2580)|[링크]()| +|좋은 수열|[링크](http://boj.kr/2661)|[링크]()| + +> 더 많은 문제를 풀고 싶다면 [해당 링크](https://github.com/tony9402/baekjoon/tree/main/brute_force) 와 [해당 링크](https://github.com/tony9402/baekjoon/tree/main/backtracking) 내 문제를 풀어 보세요! \ No newline at end of file diff --git "a/Concept/Prev/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Cpp.pdf" "b/Concept/Prev/vol.1/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Cpp.pdf" similarity index 100% rename from "Concept/Prev/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Cpp.pdf" rename to "Concept/Prev/vol.1/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Cpp.pdf" diff --git "a/Concept/Prev/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Python.pdf" "b/Concept/Prev/vol.1/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Python.pdf" similarity index 100% rename from "Concept/Prev/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Python.pdf" rename to "Concept/Prev/vol.1/01_Queue_Stack/Ch.01_\355\201\220_\354\212\244\355\203\235_Python.pdf" diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_10773.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_10773.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_10773.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_10773.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_1158.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_1158.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_1158.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_1158.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_17592.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_17592.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_17592.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_17592.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_2164.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_2164.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_2164.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_2164.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_9012.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_9012.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/BOJ_9012.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/BOJ_9012.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/Programmers_42584.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/Programmers_42584.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/Programmers_42584.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/Programmers_42584.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/C++/Programmers_42586.cpp b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/Programmers_42586.cpp similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/C++/Programmers_42586.cpp rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/C++/Programmers_42586.cpp diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_10773.py b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_10773.py similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_10773.py rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_10773.py diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_1158.py b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_1158.py similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_1158.py rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_1158.py diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_2164.py b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_2164.py similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_2164.py rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_2164.py diff --git a/Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_9012.py b/Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_9012.py similarity index 100% rename from Concept/Prev/01_Queue_Stack/SampleCode/Python/BOJ_9012.py rename to Concept/Prev/vol.1/01_Queue_Stack/SampleCode/Python/BOJ_9012.py diff --git "a/Concept/Prev/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Cpp.pdf" "b/Concept/Prev/vol.1/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Cpp.pdf" similarity index 100% rename from "Concept/Prev/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Cpp.pdf" rename to "Concept/Prev/vol.1/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Cpp.pdf" diff --git "a/Concept/Prev/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Python.pdf" "b/Concept/Prev/vol.1/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Python.pdf" similarity index 100% rename from "Concept/Prev/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Python.pdf" rename to "Concept/Prev/vol.1/02_Bruteforce/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211_Python.pdf" diff --git "a/Concept/Prev/03_Sorting/Ch.03_\354\240\225\353\240\254_Cpp.pdf" "b/Concept/Prev/vol.1/03_Sorting/Ch.03_\354\240\225\353\240\254_Cpp.pdf" similarity index 100% rename from "Concept/Prev/03_Sorting/Ch.03_\354\240\225\353\240\254_Cpp.pdf" rename to "Concept/Prev/vol.1/03_Sorting/Ch.03_\354\240\225\353\240\254_Cpp.pdf" diff --git "a/Concept/Prev/03_Sorting/Ch.03_\354\240\225\353\240\254_Python.pdf" "b/Concept/Prev/vol.1/03_Sorting/Ch.03_\354\240\225\353\240\254_Python.pdf" similarity index 100% rename from "Concept/Prev/03_Sorting/Ch.03_\354\240\225\353\240\254_Python.pdf" rename to "Concept/Prev/vol.1/03_Sorting/Ch.03_\354\240\225\353\240\254_Python.pdf" diff --git "a/Concept/Prev/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Cpp.pdf" "b/Concept/Prev/vol.1/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Cpp.pdf" similarity index 100% rename from "Concept/Prev/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Cpp.pdf" rename to "Concept/Prev/vol.1/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Cpp.pdf" diff --git "a/Concept/Prev/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Python.pdf" "b/Concept/Prev/vol.1/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Python.pdf" similarity index 100% rename from "Concept/Prev/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Python.pdf" rename to "Concept/Prev/vol.1/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211_Python.pdf" diff --git "a/Concept/Prev/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Cpp.pdf" "b/Concept/Prev/vol.1/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Cpp.pdf" similarity index 100% rename from "Concept/Prev/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Cpp.pdf" rename to "Concept/Prev/vol.1/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Cpp.pdf" diff --git "a/Concept/Prev/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Python.pdf" "b/Concept/Prev/vol.1/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Python.pdf" similarity index 100% rename from "Concept/Prev/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Python.pdf" rename to "Concept/Prev/vol.1/05_Heap_Hash/Ch.05_\355\236\231_\355\225\264\354\213\234_Python.pdf" diff --git "a/Concept/Prev/06_Greedy/Ch.06_\355\203\220\354\232\225\353\262\225.pdf" "b/Concept/Prev/vol.1/06_Greedy/Ch.06_\355\203\220\354\232\225\353\262\225.pdf" similarity index 100% rename from "Concept/Prev/06_Greedy/Ch.06_\355\203\220\354\232\225\353\262\225.pdf" rename to "Concept/Prev/vol.1/06_Greedy/Ch.06_\355\203\220\354\232\225\353\262\225.pdf" diff --git "a/Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part1.pdf" "b/Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part1.pdf" similarity index 100% rename from "Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part1.pdf" rename to "Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part1.pdf" diff --git "a/Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part2.pdf" "b/Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part2.pdf" similarity index 100% rename from "Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part2.pdf" rename to "Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Cpp_Part2.pdf" diff --git "a/Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part1.pdf" "b/Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part1.pdf" similarity index 100% rename from "Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part1.pdf" rename to "Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part1.pdf" diff --git "a/Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part2.pdf" "b/Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part2.pdf" similarity index 100% rename from "Concept/Prev/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part2.pdf" rename to "Concept/Prev/vol.1/07_Graph_Traversal/Ch.07_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211_Python_Part2.pdf" diff --git a/Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_1260.py b/Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_1260.py similarity index 100% rename from Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_1260.py rename to Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_1260.py diff --git a/Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_2178.py b/Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_2178.py similarity index 100% rename from Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_2178.py rename to Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_2178.py diff --git a/Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_2606.py b/Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_2606.py similarity index 100% rename from Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_2606.py rename to Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_2606.py diff --git a/Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_2667.py b/Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_2667.py similarity index 100% rename from Concept/Prev/07_Graph_Traversal/Sample_Code/Python/BOJ_2667.py rename to Concept/Prev/vol.1/07_Graph_Traversal/Sample_Code/Python/BOJ_2667.py diff --git "a/Concept/Prev/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Cpp.pdf" "b/Concept/Prev/vol.1/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Cpp.pdf" similarity index 100% rename from "Concept/Prev/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Cpp.pdf" rename to "Concept/Prev/vol.1/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Cpp.pdf" diff --git "a/Concept/Prev/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Python.pdf" "b/Concept/Prev/vol.1/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Python.pdf" similarity index 100% rename from "Concept/Prev/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Python.pdf" rename to "Concept/Prev/vol.1/08_Implementation/Ch.08_\352\265\254\355\230\204\353\240\245_\355\212\270\353\240\210\354\235\264\353\213\235_Python.pdf" diff --git "a/Concept/Prev/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part1.pdf" "b/Concept/Prev/vol.1/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part1.pdf" similarity index 100% rename from "Concept/Prev/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part1.pdf" rename to "Concept/Prev/vol.1/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part1.pdf" diff --git "a/Concept/Prev/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part2.pdf" "b/Concept/Prev/vol.1/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part2.pdf" similarity index 100% rename from "Concept/Prev/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part2.pdf" rename to "Concept/Prev/vol.1/09_Graph_Algorithm/Ch.09_\352\267\270\353\236\230\355\224\204_\354\265\234\353\213\250\352\261\260\353\246\254_MST_Part2.pdf" diff --git "a/Concept/Prev/10_Two_Pointer/Ch.10_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" "b/Concept/Prev/vol.1/10_Two_Pointer/Ch.10_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" similarity index 100% rename from "Concept/Prev/10_Two_Pointer/Ch.10_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" rename to "Concept/Prev/vol.1/10_Two_Pointer/Ch.10_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" diff --git "a/Concept/Prev/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part1.pdf" "b/Concept/Prev/vol.1/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part1.pdf" similarity index 100% rename from "Concept/Prev/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part1.pdf" rename to "Concept/Prev/vol.1/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part1.pdf" diff --git "a/Concept/Prev/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part2.pdf" "b/Concept/Prev/vol.1/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part2.pdf" similarity index 100% rename from "Concept/Prev/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part2.pdf" rename to "Concept/Prev/vol.1/11_Dynamic_Programming/Ch.11_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225_Part2.pdf" diff --git "a/Concept/Prev/12_Tree/Ch.12_\355\212\270\353\246\254.pdf" "b/Concept/Prev/vol.1/12_Tree/Ch.12_\355\212\270\353\246\254.pdf" similarity index 100% rename from "Concept/Prev/12_Tree/Ch.12_\355\212\270\353\246\254.pdf" rename to "Concept/Prev/vol.1/12_Tree/Ch.12_\355\212\270\353\246\254.pdf" diff --git a/Concept/Prev/00_Special/Pythonic_Code_For_Coding_Test.md b/Concept/Prev/vol.2/00_Special/Pythonic_Code_For_Coding_Test.md similarity index 100% rename from Concept/Prev/00_Special/Pythonic_Code_For_Coding_Test.md rename to Concept/Prev/vol.2/00_Special/Pythonic_Code_For_Coding_Test.md diff --git "a/Concept/New/01_Data_Structure/Ch.01_\352\270\260\353\263\270_\354\236\220\353\243\214\352\265\254\354\241\260.pdf" "b/Concept/Prev/vol.2/01_Data_Structure/Ch.01_\352\270\260\353\263\270_\354\236\220\353\243\214\352\265\254\354\241\260.pdf" similarity index 100% rename from "Concept/New/01_Data_Structure/Ch.01_\352\270\260\353\263\270_\354\236\220\353\243\214\352\265\254\354\241\260.pdf" rename to "Concept/Prev/vol.2/01_Data_Structure/Ch.01_\352\270\260\353\263\270_\354\236\220\353\243\214\352\265\254\354\241\260.pdf" diff --git "a/Concept/New/02_Implementation/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" "b/Concept/Prev/vol.2/02_Implementation/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" similarity index 100% rename from "Concept/New/02_Implementation/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" rename to "Concept/Prev/vol.2/02_Implementation/Ch.02_\354\231\204\354\240\204\355\203\220\354\203\211.pdf" diff --git "a/Concept/New/03_Sorting/Ch.03_\354\240\225\353\240\254.pdf" "b/Concept/Prev/vol.2/03_Sorting/Ch.03_\354\240\225\353\240\254.pdf" similarity index 100% rename from "Concept/New/03_Sorting/Ch.03_\354\240\225\353\240\254.pdf" rename to "Concept/Prev/vol.2/03_Sorting/Ch.03_\354\240\225\353\240\254.pdf" diff --git "a/Concept/New/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211.pdf" "b/Concept/Prev/vol.2/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211.pdf" similarity index 100% rename from "Concept/New/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211.pdf" rename to "Concept/Prev/vol.2/04_Binary_Search/Ch.04_\354\235\264\353\266\204\355\203\220\354\203\211.pdf" diff --git "a/Concept/New/05_Greedy/Ch.05_\355\203\220\354\232\225\353\262\225.pdf" "b/Concept/Prev/vol.2/05_Greedy/Ch.05_\355\203\220\354\232\225\353\262\225.pdf" similarity index 100% rename from "Concept/New/05_Greedy/Ch.05_\355\203\220\354\232\225\353\262\225.pdf" rename to "Concept/Prev/vol.2/05_Greedy/Ch.05_\355\203\220\354\232\225\353\262\225.pdf" diff --git "a/Concept/New/06_Graph_Traversal/Ch.06_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211.pdf" "b/Concept/Prev/vol.2/06_Graph_Traversal/Ch.06_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211.pdf" similarity index 100% rename from "Concept/New/06_Graph_Traversal/Ch.06_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211.pdf" rename to "Concept/Prev/vol.2/06_Graph_Traversal/Ch.06_\352\267\270\353\236\230\355\224\204_\355\203\220\354\203\211.pdf" diff --git "a/Concept/New/08_Graph_Algorithm/Ch.08_\352\267\270\353\236\230\355\224\204_\354\225\214\352\263\240\353\246\254\354\246\230.pdf" "b/Concept/Prev/vol.2/08_Graph_Algorithm/Ch.08_\352\267\270\353\236\230\355\224\204_\354\225\214\352\263\240\353\246\254\354\246\230.pdf" similarity index 100% rename from "Concept/New/08_Graph_Algorithm/Ch.08_\352\267\270\353\236\230\355\224\204_\354\225\214\352\263\240\353\246\254\354\246\230.pdf" rename to "Concept/Prev/vol.2/08_Graph_Algorithm/Ch.08_\352\267\270\353\236\230\355\224\204_\354\225\214\352\263\240\353\246\254\354\246\230.pdf" diff --git "a/Concept/New/09_Two_Pointer/Ch.09_\353\266\200\353\266\204\355\225\251_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" "b/Concept/Prev/vol.2/09_Two_Pointer/Ch.09_\353\266\200\353\266\204\355\225\251_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" similarity index 100% rename from "Concept/New/09_Two_Pointer/Ch.09_\353\266\200\353\266\204\355\225\251_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" rename to "Concept/Prev/vol.2/09_Two_Pointer/Ch.09_\353\266\200\353\266\204\355\225\251_\355\210\254\355\217\254\354\235\270\355\204\260.pdf" diff --git "a/Concept/New/10_Dynamic_Programming/Ch.10_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225.pdf" "b/Concept/Prev/vol.2/10_Dynamic_Programming/Ch.10_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225.pdf" similarity index 100% rename from "Concept/New/10_Dynamic_Programming/Ch.10_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225.pdf" rename to "Concept/Prev/vol.2/10_Dynamic_Programming/Ch.10_\353\217\231\354\240\201\352\263\204\355\232\215\353\262\225.pdf" diff --git "a/Concept/New/11_Tree/Ch.11_\355\212\270\353\246\254.pdf" "b/Concept/Prev/vol.2/11_Tree/Ch.11_\355\212\270\353\246\254.pdf" similarity index 100% rename from "Concept/New/11_Tree/Ch.11_\355\212\270\353\246\254.pdf" rename to "Concept/Prev/vol.2/11_Tree/Ch.11_\355\212\270\353\246\254.pdf" diff --git a/README.md b/README.md index f5c443c..cb47151 100644 --- a/README.md +++ b/README.md @@ -1,11 +1,55 @@ Algorithm_Study ================ -~21년 2월까지 진행되는 수업 자료를 관리하는 Git 페이지 입니다. -수업과 별개로, 자료는 주기적으로 업로드 예정입니다. - -추후 작업 예정 ----------------- -- KAKAO 2021 blind recruitment 1차 코딩테스트 기출 -- Concept -> 동적계획법, 트리, 분할정복 등등... -- 처음 진입하는 사람들을 위한 문제 푸는 방법, 기초 문제 선별 +알고리즘 강의 및 과외에서 사용하는 자료입니다. + +강의 및 과외 문의는 이메일로 부탁드립니다. + +현재는 Python으로만 자료를 제공하고 있습니다. 추후 C++ 및 Java Solution 코드도 추가 예정입니다. + +--- + +## 자료 현황 + +현재 리뉴얼 작업 중에 있습니다. + +해당 링크에 있는 자료들은 기본 개념 pdf, 추천 문제 목록 및 solution 으로 구성되어 있습니다. + +|단원|링크|상태| +|---|---|---| +|자료구조||| +|완전탐색, 백트래킹|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/New/02_Bruteforcing)|기본 개념 완성, 문제 solution 예정| +|정렬||| +|이진탐색||| +|그리디 알고리즘||| +|그래프 탐색||| +|시뮬레이션, 구현||| +|그래프 알고리즘||| +|부분합, 투포인터||| +|다이나믹 프로그래밍||| +|트리||| +|위상정렬||| + +### 기존 자료 + +리뉴얼 전 기존 자료들을 확인할 수 있습니다. + +[vol.2](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2) +-- +|단원|링크| +|---|---| +|코테용 파이썬|[링크](https://github.com/VSFe/Algorithm_Study/blob/main/Concept/Prev/vol.2/00_Special/Pythonic_Code_For_Coding_Test.md)| +|자료구조|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/01_Data_Structure)| +|완전탐색, 백트래킹|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/New/02_Bruteforcing)| +|정렬|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/03_Sorting)| +|이진탐색|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/04_Binary_Search)| +|그리디 알고리즘|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/05_Greedy)| +|그래프 탐색|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/06_Graph_Traversal)| +|그래프 알고리즘|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/08_Graph_Algorithm)| +|부분합, 투포인터|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/09_Two_Pointer)| +|다이나믹 프로그래밍|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/10_Dynamic_Programming)| +|트리|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/11_Tree)| + + +[vol.1](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.1) +-