Write a function to find the longest common prefix string amongst an array of strings.
/**
* @param {string[]} strs
* @return {string}
*/
var longestCommonPrefix = function(strs) {
var ll = strs.length;
if(ll===0){
return "";
}
var common = strs[0];
for(var i=1;i<ll;i++){
var lc = common.length;
var curstr = strs[i];
var ln = curstr.length;
var min = Math.min(ln,lc);
var tempstr = "";
for(var j=0;j<min;j++){
if(curstr[j]===common[j]){
tempstr += common[j];
}else{
break;
}
}
common = tempstr;
}
return common;
};