Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 76ca43d

Browse files
committed
readme.md modified
1 parent 4aea629 commit 76ca43d

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -100,7 +100,7 @@ In mathematics and computer science, an algorithm is a finite sequence of well-d
100100

101101
- [LCS(Longest Common Subsequence)](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/LCS.java) - 최장 공통 부분 순서(Compare with 3 Strings), Bottom Up Manner O(n^3)
102102

103-
- LCS(Longest Common Substring) - 최장 공통 부분 문자열(Compare with 2 Strings), Bottom Up Manner O(n^2)
103+
- [LCS(Longest Common Substring)](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/LongestCommonSubstring.java) - 최장 공통 부분 문자열(Compare with 2 Strings), Bottom Up Manner O(n^2)
104104

105105
- [LIS(Longest Increasing Subsequence)](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/LongestIncreasingSubSequence.java) - 최장 증가 부분순서, Bottom Up Manner O(n^2)
106106

@@ -112,7 +112,7 @@ In mathematics and computer science, an algorithm is a finite sequence of well-d
112112

113113
- [Tiling Dominoes](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/TilingDominoes.java) - 타일링 문제, e.g 2 x N or 3 x N and so on
114114

115-
- Edit Distance - 편집거리
115+
- [Edit Distance](https://github.com/lemidia/Algorithm-and-Data-Structure/blob/master/AlgorithmCode/EditDistance.java) - 편집거리
116116

117117
- Matrix Multiplication
118118

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /