Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string ""
.
Example 1:
Input: ["flower","flow","flight"] Output: "fl"
Example 2:
Input: ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings.
Note:
All given inputs are in lowercase letters a-z
.
class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length==0) return "";
String pre = strs[0];
for(int i = 1;i<strs.length;i++){
while(!str[i].StartsWith(pre)){
pre = pre.substring(0,pre.length()-1);//去掉最后面的字符
}
if pre.length()==0 return "";
}
return pre;
}
}