Commit219d1d9

committed

改进718.最长重复子数组Java版本代码

1 parent20ec965 commit219d1d9Copy full SHA for 219d1d9

File tree

+23

-2

lines changed

+23

-2

lines changed

Lines changed: 23 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,7 +20,7 @@ B: [3,2,1,4,7]`
`20`	`20`	`输出：3`
`21`	`21`	`解释：`
`22`	`22`	`长度最长的公共子数组是[3, 2, 1] 。`
`23`		`-`
	`23`	`+`
`24`	`24`	`提示：`
`25`	`25`
`26`	`26`	`* 1 <= len(A), len(B) <= 1000`
`@@ -155,6 +155,7 @@ public:`
`155`	`155`
`156`	`156`	`Java：`
`157`	`157`	```java
	`158`	`+// 版本一`
`158`	`159`	`classSolution {`
`159`	`160`	`publicintfindLength(int[]nums1,int[]nums2) {`
`160`	`161`	`int result=0;`
`@@ -164,14 +165,34 @@ class Solution {`
`164`	`165`	`for (int j=1; j< nums2.length+1; j++) {`
`165`	`166`	`if (nums1[i-1]== nums2[j-1]) {`
`166`	`167`	`dp[i][j]= dp[i-1][j-1]+1;`
`167`		`-max=Math.max(max, dp[i][j]);`
	`168`	`+result=Math.max(result, dp[i][j]);`
`168`	`169`	`}`
`169`	`170`	`}`
`170`	`171`	`}`
`171`	`172`
`172`	`173`	`return result;`
`173`	`174`	`}`
`174`	`175`	`}`
	`176`	`+`
	`177`	`+// 版本二: 滚动数组`
	`178`	`+classSolution {`
	`179`	`+publicintfindLength(int[]nums1,int[]nums2) {`
	`180`	`+int[] dp=newint[nums2.length+1];`
	`181`	`+int result=0;`
	`182`	`+`
	`183`	`+for (int i=1; i<= nums1.length; i++) {`
	`184`	`+for (int j= nums2.length; j>0; j--) {`
	`185`	`+if (nums1[i-1]== nums2[j-1]) {`
	`186`	`+ dp[j]= dp[j-1]+1;`
	`187`	`+ }else {`
	`188`	`+ dp[j]=0;`
	`189`	`+ }`
	`190`	`+ result=Math.max(result, dp[j]);`
	`191`	`+ }`
	`192`	`+ }`
	`193`	`+return result;`
	`194`	`+ }`
	`195`	`+}`
`175`	`196`	```
`176`	`197`
`177`	`198`	`Python：`

Comments

(0)