编写一个函数来查找字符串数组中的最长公共前缀。如果不存在公共前缀,返回空字符串 ""。示例 1:输入:strs = ["flower","flow","flight"]输出:"fl"示例 2:输入:strs = ["dog","racecar","car"]输出:""解释:输入不存在公共前缀。提示:0 <= strs.length <= 2000 <= strs[i].length <= 200strs[i] 仅由小写英文字母组成
var longestCommonPrefix = function(strs) {
var res = '';
if (!strs.length) return res;
for (var j=0;j<strs[0].length;j++){//第j位
for (var i=1;i<strs.length;i++){//第i个
if (strs[i][j]!=strs[0][j]) return res
}
res += strs[0][j];
}
return res;
};
var longestCommonPrefix = function (strs,res = '') {
if (!strs.length) return res;
if (strs.length == 1) return strs[0];
for (var i = 1; i < strs.length; i++) {
if (!strs[i][0]) return res
if (strs[i][0] != strs[0][0]) return res
strs[i] = strs[i].slice(1,strs[i].length);
}
res += strs[0][0];
strs[0] = strs[0].slice(1,strs[0].length);
return longestCommonPrefix(strs, res);
};
