Commite9160df

committed

longest

1 parentb6f4e08 commite9160dfCopy full SHA for e9160df

File tree

+34

-7

lines changed

+34

-7

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+packageAlgorithms.string;`
	`2`	`+`
	`3`	`+publicclassLongestCommonPrefix {`
	`4`	`+//http://blog.csdn.net/fightforyourdream/article/details/14642079`
	`5`	`+publicStringlongestCommonPrefix(String[]strs) {`
	`6`	`+if (strs ==null) {`
	`7`	`+returnnull;`
	`8`	`+ }`
	`9`	`+`
	`10`	`+if (strs.length ==0) {`
	`11`	`+return"";`
	`12`	`+ }`
	`13`	`+`
	`14`	`+Strings =strs[0];`
	`15`	`+intlen =s.length();`
	`16`	`+`
	`17`	`+for (inti =0;i <len;i++) {`
	`18`	`+charc =s.charAt(i);`
	`19`	`+`
	`20`	`+for (intj =1;j <strs.length;j++) {`
	`21`	`+if (strs[j].length() <=i \|\|c !=strs[j].charAt(i)) {`
	`22`	`+// The char i is invalid. 因为读到i时退出，所以不应包含i本身。`
	`23`	`+returns.substring(0,i);`
	`24`	`+ }`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+`
	`28`	`+// Didn't break, the whole String is valid.`
	`29`	`+returns;`
	`30`	`+ }`
	`31`	`+}`

Lines changed: 3 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,14 +18,8 @@ public boolean isMatchRec(String s, String p, int indexS, int indexP) {`
`18`	`18`	`returnindexS ==lenS;`
`19`	`19`	`}`
`20`	`20`
`21`		`-// only 1 match character left.`
`22`		`-if (indexP ==lenP -1) {`
`23`		`-// String should also have 1 character left.`
`24`		`-returnindexS ==lenS -1 &&isMatchChar(s.charAt(indexS),p.charAt(indexP));`
`25`		`- }`
`26`		`-`
`27`	`21`	`// At lease 2 match character left`
`28`		`-if (p.charAt(indexP +1) =='*') {`
	`22`	`+if (indexP <lenP -1 &&p.charAt(indexP +1) =='*') {`
`29`	`23`	`// match 0;`
`30`	`24`	`if (isMatchRec(s,p,indexS,indexP +2)) {`
`31`	`25`	`returntrue;`
`@@ -65,4 +59,6 @@ public boolean isMatchChar(char s, char p) {`
`65`	`59`	`returnfalse;`
`66`	`60`	`}`
`67`	`61`
	`62`	`+}`
	`63`	`+`
`68`	`64`	`}`

Comments

(0)