Commit0f59249

piggy1991

committed

llint

1 parent03fcafa commit0f59249Copy full SHA for 0f59249

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+packageAlgorithms.lintcode.dp;`
	`2`	`+`
	`3`	`+publicclassLongestCommonSubstring {`
	`4`	`+/**`
	`5`	`+ * @param A, B: Two string.`
	`6`	`+ * @return: the length of the longest common substring.`
	`7`	`+ */`
	`8`	`+publicintlongestCommonSubstring(StringA,StringB) {`
	`9`	`+// write your code here`
	`10`	`+if (A ==null \|\|B ==null) {`
	`11`	`+return0;`
	`12`	`+ }`
	`13`	`+`
	`14`	`+intlenA =A.length();`
	`15`	`+intlenB =B.length();`
	`16`	`+`
	`17`	`+// bug 1: use error init.`
	`18`	`+int[][]D =newint[lenA +1][lenB +1];`
	`19`	`+`
	`20`	`+intmax =0;`
	`21`	`+`
	`22`	`+// BUG 2: should use <= instead of <`
	`23`	`+for (inti =0;i <=lenA;i++) {`
	`24`	`+for (intj =0;j <=lenB;j++) {`
	`25`	`+if (i ==0 \|\|j ==0) {`
	`26`	`+D[i][j] =0;`
	`27`	`+ }else {`
	`28`	`+if (A.charAt(i -1) ==B.charAt(j -1)) {`
	`29`	`+D[i][j] =D[i -1][j -1] +1;`
	`30`	`+ }else {`
	`31`	`+D[i][j] =0;`
	`32`	`+ }`
	`33`	`+ }`
	`34`	`+`
	`35`	`+max =Math.max(max,D[i][j]);`
	`36`	`+ }`
	`37`	`+ }`
	`38`	`+`
	`39`	`+returnmax;`
	`40`	`+ }`
	`41`	`+}`

Comments

(0)