Commit c25a765

authored

新增java:用最長公共子序列反推

1 parent 59a9280 commit c25a765Copy full SHA for c25a765

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -184,6 +184,31 @@ class Solution {`
`184`	`184`	`}`
`185`	`185`	`}`
`186`	`186`	```
	`187`	+```java
	`188`	`+//DP - longest common subsequence (用最長公共子序列反推)`
	`189`	`+class Solution {`
	`190`	`+ public int minDistance(String word1, String word2) {`
	`191`	`+ char[] char1 = word1.toCharArray();`
	`192`	`+ char[] char2 = word2.toCharArray();`
	`193`	`+`
	`194`	`+ int len1 = char1.length;`
	`195`	`+ int len2 = char2.length;`
	`196`	`+`
	`197`	`+ int dp[][] = new int [len1 + 1][len2 + 1];`
	`198`	`+`
	`199`	`+ for(int i = 1; i <= len1; i++){`
	`200`	`+ for(int j = 1; j <= len2; j++){`
	`201`	`+ if(char1[i - 1] == char2[j - 1])`
	`202`	`+ dp[i][j] = dp[i - 1][j - 1] + 1;`
	`203`	`+ else`
	`204`	`+ dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);`
	`205`	`+ }`
	`206`	`+ }`
	`207`	`+`
	`208`	`+ return len1 + len2 - (2 * dp[len1][len2]);//和leetcode 1143只差在這一行。`
	`209`	`+ }`
	`210`	`+}`
	`211`	+```
`187`	`212`
`188`	`213`
`189`	`214`	`Python:`

Comments

(0)