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
思路
以字符串中第一个字符串为基准,找出该字符串中所有的字符;其他字符串一一进行比较;这里主要是考虑边界问题;比如第一个字符串是 “aa” ,第二个字符串是"a"; 要保证第二个字符串不能越界
public static String longestCommonPrefix(String[] strs) {
if(strs.length > 0) {
char[] strs_char = strs[0].toCharArray();
String returnStr = "";
str:for(int i = 0 ;i <strs_char.length;i++) {
char currentChar = strs_char[i];
for(int j = 1; j<strs.length;j++) {
if(strs[j].toCharArray().length -1 < i ) {
break str;
}
if(currentChar!=strs[j].charAt(i)) {
break str;
}
}
returnStr = returnStr+String.valueOf(currentChar);
}
return returnStr;
}
return "";
}