Skip to content

Commit 5d3309c

Browse files
tony9402tony9402
committed
feat: [Renewal] update Main README
1 parent 32da731 commit 5d3309c

File tree

6 files changed

+61
-129
lines changed

6 files changed

+61
-129
lines changed

‎baekjoon_utils/baekjoon_utils/main.py

+27
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@
44

55
from baekjoon_utils.daily.pick import TodayProblemPicker
66
from baekjoon_utils.docs.problem import ProblemByTag
7+
from baekjoon_utils.docs.contributor import make_table as contributor_make_table
78
from baekjoon_utils.core.solved_api import SolvedAPI
89
from baekjoon_utils.utils import get_today_date_kst_str
910

@@ -35,6 +36,15 @@ def main():
3536

3637
api = SolvedAPI()
3738
if option & 2:
39+
# Update Contributors
40+
contributors = contributor_make_table()
41+
42+
with open("markdown/contributors.md", "w") as f:
43+
f.write("## Contributors\n\n")
44+
f.write(contributors + "\n\n")
45+
f.close()
46+
47+
# Update Problems
3848
api.update_all()
3949
tags = glob("algorithms/*")
4050
for tag_path in tags:
@@ -75,6 +85,23 @@ def main():
7585

7686
picker.save()
7787

88+
# Update README
89+
base_folder = "markdown"
90+
md_seq = ["header.md", "codingtest_info.md", "workbook_header.md", "workbook.md", "workbook_footer.md", "contributors.md", "updatelog.md", "TODO.md", "footer.md"]
91+
92+
assemble_text = ""
93+
for md_path in md_seq:
94+
path = os.path.join(base_folder, md_path)
95+
if not os.path.exists(path):
96+
continue
97+
98+
with open(path, 'r') as f:
99+
assemble_text = f"{assemble_text}{f.read()}"
100+
f.close()
101+
102+
with open("test.md", "w") as f:
103+
f.write(assemble_text)
104+
f.close()
78105

79106
if __name__ == "__main__":
80107
os.environ["TZ"] = "Asia/Seoul"

‎change_level.log

-100
This file was deleted.

‎guideline_for_contribute.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# 📕 문제 풀이 컨트리뷰트 가이드라인
22

3-
**솔루션 PR은 [여기](https://github.com/tony9402/solutions_for_baekjoon_problems)로 옮겼습니다. 현재 대학원 졸업준비로 인해 업데이트를 못하고 있습니다...**
3+
**솔루션 PR은 [여기](https://github.com/tony9402/solutions_for_baekjoon_problems)로 옮겼습니다.**
44
**가이드라인은 계속 업데이트 될 수 있습니다. 가이드라인이 업데이트 된 시점부터 한달동안 Issue에도 올리겠습니다.**
55

66
<!-- 1694 x 1588 (1.06675 : 1) -->

‎link_for_study.md

+5-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,9 @@
11
# 알고리즘 설명 링크 모음
22

3+
4+
여기있는 자료 이외에도 좋은 자료들이 있다면 Discussions이나 Issue에 공유해주시면 확인 후 업데이트 하겠습니다.
5+
6+
37
### 1. [VSFe](https://github.com/VSFe)
48

59
<table>
@@ -155,4 +159,4 @@
155159

156160
#### 공부자료
157161
* [대회알고리즘 (Blog)](https://blog.naver.com/kks227/220769859177) [무료]
158-
* [Github](https://github.com/kks227/BOJ) [무료]
162+
* [Github](https://github.com/kks227/BOJ) [무료]

‎markdown/header.md

+5
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,13 @@
11
# 코딩테스트 대비 문제집 with Baekjoon
22

33
[![Auto Update README](https://github.com/tony9402/baekjoon/actions/workflows/auto_update.yml/badge.svg)](https://github.com/tony9402/baekjoon/actions/workflows/auto_update.yml)
4+
5+
<!--
46
[![Auto Update README](https://github.com/tony9402/baekjoon/actions/workflows/auto_solution_update.yml/badge.svg)](https://github.com/tony9402/baekjoon/actions/workflows/auto_solution_update.yml)
7+
-->
8+
<!--
59
[![Auto Update README](https://github.com/tony9402/baekjoon/actions/workflows/auto_pick.yml/badge.svg)](https://github.com/tony9402/baekjoon/actions/workflows/auto_pick.yml)
10+
-->
611

712
[![하루 방문자 수](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2Ftony9402%2Fbaekjoon)](https://github.com/tony9402/baekjoon)
813
[![Discussions](https://img.shields.io/badge/discussions-바로가기-brightgreen)](https://github.com/tony9402/baekjoon/discussions)

‎markdown/workbook.md

+23-27
Original file line numberDiff line numberDiff line change
@@ -1,29 +1,25 @@
11
| 순번 | Tag | 태그 | 문제집 | 추천 문제 수 | 총 문제 수 | 상태 |
22
| :--: | :--------------------------: | :-----------------: | :------: | :---------: | :------: |:---------------:|
3-
| 00 | Data Structure | 자료구조 | [바로가기](./data_structure) | 16 | 25 | ![status][Doing] |
4-
| 01 | Data Structure 2 | 자료구조 2 | [바로가기](./data_structure2) | 11 | 21 | ![status][Doing] |
5-
| 02 | Tree | 트리 | [바로가기](./tree) | 15 | 44 | ![status][Doing] |
6-
| 03 | Math | 수학 | [바로가기](./math) | 18 | 29 | ![status][Doing] |
7-
| 04 | Greedy | 탐욕법 | [바로가기](./greedy) | 27 | 62 | ![status][Doing] |
8-
| 05 | Dynamic Programming 1 | 동적계획법 1 | [바로가기](./dynamic_programming_1) | 27 | 80 | ![status][Doing] |
9-
| 06 | Dynamic Programming 2 | 동적계획법 2 | [바로가기](./dynamic_programming_2) | 28 | 81 | ![status][Doing] |
10-
| 07 | Two Pointer | 투 포인터 | [바로가기](./two_pointer) | 13 | 36 | ![status][Doing] |
11-
| 08 | Implementation | 구현 | [바로가기](./implementation) | 30 | 51 | ![status][Doing] |
12-
| 09 | Graph Traversal | 그래프 탐색 | [바로가기](./graph_traversal) | 31 | 96 | ![status][Doing] |
13-
| 10 | Brute Force | 완전탐색 | [바로가기](./brute_force) | 33 | 94 | ![status][Doing] |
14-
| 11 | Simulation | 시뮬레이션 | [바로가기](./simulation) | 30 | 48 | ![status][Doing] |
15-
| 12 | Binary Search | 이분탐색 | [바로가기](./binary_search) | 20 | 66 | ![status][Doing] |
16-
| 13 | Backtracking | 백트래킹 | [바로가기](./backtracking) | 28 | 75 | ![status][Doing] |
17-
| 14 | Divide and conquer | 분할정복 | [바로가기](./divide_and_conquer) | 08 | 18 | ![status][Doing] |
18-
| 15 | Prefix Sum | 누적 합 | [바로가기](./prefix_sum) | 11 | 32 | ![status][Doing] |
19-
| 16 | String | 문자열 | [바로가기](./string) | 19 | 63 | ![status][Doing] |
20-
| 17 | Shortest Path | 최단거리 | [바로가기](./shortest_path) | 18 | 53 | ![status][Doing] |
21-
| 18 | Topological Sorting | 위상정렬 | [바로가기](./topological_sorting) | 05 | 14 | ![status][Doing] |
22-
| 19 | Disjoint Set | 분리 집합 | [바로가기](./disjoint_set) | 06 | 20 | ![status][Doing] |
23-
| 20 | Minimum Spanning Tree(MST) | 최소 스패닝 트리 | [바로가기](./minimum_spanning_tree) | 08 | 24 | ![status][Doing] |
24-
| 21 | Trie | 트라이 | [바로가기](./trie) | 05 | 09 | ![status][Doing] |
25-
| 22 | Dynamic Programming On Trees | 트리디피 | [바로가기](./dynamic_programming_on_trees) | 04 | 08 | ![status][Doing] |
26-
27-
28-
29-
3+
| 00 | Data Structure | 자료구조 | [바로가기](./algorithms/data_structure) | 16 | 25 | ![status][Doing] |
4+
| 01 | Data Structure 2 | 자료구조 2 | [바로가기](./algorithms/data_structure2) | 11 | 21 | ![status][Doing] |
5+
| 02 | Tree | 트리 | [바로가기](./algorithms/tree) | 15 | 44 | ![status][Doing] |
6+
| 03 | Math | 수학 | [바로가기](./algorithms/math) | 18 | 29 | ![status][Doing] |
7+
| 04 | Greedy | 탐욕법 | [바로가기](./algorithms/greedy) | 27 | 62 | ![status][Doing] |
8+
| 05 | Dynamic Programming 1 | 동적계획법 1 | [바로가기](./algorithms/dynamic_programming_1) | 27 | 80 | ![status][Doing] |
9+
| 06 | Dynamic Programming 2 | 동적계획법 2 | [바로가기](./algorithms/dynamic_programming_2) | 28 | 81 | ![status][Doing] |
10+
| 07 | Two Pointer | 투 포인터 | [바로가기](./algorithms/two_pointer) | 13 | 36 | ![status][Doing] |
11+
| 08 | Implementation | 구현 | [바로가기](./algorithms/implementation) | 30 | 51 | ![status][Doing] |
12+
| 09 | Graph Traversal | 그래프 탐색 | [바로가기](./algorithms/graph_traversal) | 31 | 96 | ![status][Doing] |
13+
| 10 | Brute Force | 완전탐색 | [바로가기](./algorithms/brute_force) | 33 | 94 | ![status][Doing] |
14+
| 11 | Simulation | 시뮬레이션 | [바로가기](./algorithms/simulation) | 30 | 48 | ![status][Doing] |
15+
| 12 | Binary Search | 이분탐색 | [바로가기](./algorithms/binary_search) | 20 | 66 | ![status][Doing] |
16+
| 13 | Backtracking | 백트래킹 | [바로가기](./algorithms/backtracking) | 28 | 75 | ![status][Doing] |
17+
| 14 | Divide and conquer | 분할정복 | [바로가기](./algorithms/divide_and_conquer) | 08 | 18 | ![status][Doing] |
18+
| 15 | Prefix Sum | 누적 합 | [바로가기](./algorithms/prefix_sum) | 11 | 32 | ![status][Doing] |
19+
| 16 | String | 문자열 | [바로가기](./algorithms/string) | 19 | 63 | ![status][Doing] |
20+
| 17 | Shortest Path | 최단거리 | [바로가기](./algorithms/shortest_path) | 18 | 53 | ![status][Doing] |
21+
| 18 | Topological Sorting | 위상정렬 | [바로가기](./algorithms/topological_sorting) | 05 | 14 | ![status][Doing] |
22+
| 19 | Disjoint Set | 분리 집합 | [바로가기](./algorithms/disjoint_set) | 06 | 20 | ![status][Doing] |
23+
| 20 | Minimum Spanning Tree(MST) | 최소 스패닝 트리 | [바로가기](./algorithms/minimum_spanning_tree) | 08 | 24 | ![status][Doing] |
24+
| 21 | Trie | 트라이 | [바로가기](./algorithms/trie) | 05 | 09 | ![status][Doing] |
25+
| 22 | Dynamic Programming On Trees | 트리디피 | [바로가기](./algorithms/dynamic_programming_on_trees) | 04 | 08 | ![status][Doing] |

0 commit comments

Comments
 (0)