Longest Common Prefix
Jan 17 '12
Write a function to find the longest common prefix string amongst an array of strings.
public class Solution { public String longestCommonPrefix(String[] strs) { if(strs.length==0) return ""; if(strs.length==1) return strs[0]; StringBuffer sb=new StringBuffer(); int len=strs[0].length(); for(int i=1;i<strs.length;i++) { if(strs[i].length()<len) { len=strs[i].length(); } } for(int i=0;i<len;i++) { char c=strs[0].charAt(i); for(int j=1;j<strs.length;j++)//j means how many strings totals { if(strs[j].charAt(i)!=c) return sb.toString(); } sb.append(c); } return sb.toString(); } }
mistake: forgot to put inner loop 2) strs[0].length() is a string strs.length is an array