File tree Expand file tree Collapse file tree 2 files changed +33
-0
lines changed Expand file tree Collapse file tree 2 files changed +33
-0
lines changed Original file line number Diff line number Diff line change @@ -49,6 +49,8 @@ Step 2. Add the dependency
49
49
50
50
<summary >展开查看</summary >
51
51
52
+ https://leetcode-cn.com/problems/edit-distance/
53
+
52
54
https://leetcode.cn/problems/count-prefixes-of-a-given-string
53
55
54
56
https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/
Original file line number Diff line number Diff line change
1
+ function minDistance ( word1 : string , word2 : string ) : number {
2
+ const dp : number [ ] [ ] = Array . from ( Array ( word1 . length + 1 ) , ( ) =>
3
+ Array ( word2 . length + 1 ) . fill ( 0 )
4
+ ) ;
5
+
6
+ for ( let i = 1 ; i <= word1 . length ; i ++ ) {
7
+ dp [ i ] [ 0 ] = i ;
8
+ }
9
+
10
+ for ( let j = 1 ; j <= word2 . length ; j ++ ) {
11
+ dp [ 0 ] [ j ] = j ;
12
+ }
13
+
14
+ for ( let i = 1 ; i <= word1 . length ; i ++ ) {
15
+ for ( let j = 1 ; j <= word2 . length ; j ++ ) {
16
+ if ( word1 [ i - 1 ] === word2 [ j - 1 ] ) {
17
+ dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] ;
18
+ } else {
19
+ dp [ i ] [ j ] = Math . min (
20
+ dp [ i - 1 ] [ j ] + 1 ,
21
+ dp [ i ] [ j - 1 ] + 1 ,
22
+ dp [ i - 1 ] [ j - 1 ] + 1
23
+ ) ;
24
+ }
25
+ }
26
+ }
27
+
28
+ return dp [ word1 . length ] [ word2 . length ] ;
29
+ }
30
+
31
+ export default minDistance ;
You can’t perform that action at this time.
0 commit comments