You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+9-1Lines changed: 9 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -11,7 +11,7 @@
11
11
* 주어진 문자열이 애너그램인지를 판단한다. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/basic/IsAnagram.java)
12
12
* 주어진 문자열을 길이와 함께 적어주면서 압축을 한다. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/basic/CharacterCompressWithLength.java)
13
13
* 주어진 문서(단어별로 나뉘어진 배열)에서 특정 단어의 빈도를 구한다. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/basic/FrequencyStringInDocument.java)
14
-
14
+
* 주어진 수보다 작은 소수의 개수를 구한다. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/basic/FindPrimeNumTest.java)
15
15
16
16
### Recursion part
17
17
* Fibonacci 를 계산하는 함수를 작성한다. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/recursion/Fibonacci.java)
* N개 괄호로 만들 수 있는 모든 조합 출력하기. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/algorithm/recursion/BraceCombination.java)
23
23
24
+
---
25
+
26
+
## DataStructure
24
27
### LinkedList
25
28
* 첫번째 원소를 제거한다.
26
29
* 중복된 원소를 제거한다.
@@ -50,8 +53,13 @@
50
53
* Priority queue를 사용하여 heap sort를 하라. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/datastructure/priorityqueue/HeapSortByUsingPQ.java)
51
54
* 많은 수 중 top 10을 구한다. [Link](https://github.com/JaeYeopHan/algorithm_basic_java/blob/master/src/test/java/datastructure/priorityqueue/CalcTopTen.java)
0 commit comments