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.
思路
以Input: [“flower”,“flow”,“flight”]为例
设一个res为strs[0] flower
看res是否是strs[1]flow的substring
如果不是长度剪一
变为flowe
如此循环到flow
再和flight比较最后结果为fl
class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs == null|strs.length ==0){
return "";
}
String res = strs[0];
for(int i =1;i< strs.length;i++){
while(strs[i].indexOf(res) != 0){
res = res.substring(0,res.length()-1);
}
}
return res;
}
}