Write a function to find the longest common prefix string amongst an array of strings.
找到string数组的相同的字符串前缀
java:
public class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs == null || strs.length < 1) return "";
String prefix = strs[0];
for(int i = 1; i < strs.length; i++) {
while (strs[i].indexOf(prefix) != 0)
prefix = prefix.substring(0, prefix.length() - 1);
}
return prefix;
}
}
go:
func longestCommonPrefix(strs []string) string {
if strs == nil || len(strs) == 0 {
return ""
}
prefix := strs[0]
for _, str := range strs {
for !strings.HasPrefix(str, prefix) {
prefix = prefix[0:len(prefix)-1]
}
}
return prefix
}