1. 编写一个函数来查找字符串数组中的最长公共前缀。
    2. 如果不存在公共前缀,返回空字符串 ""
    3. 示例 1
    4. 输入:strs = ["flower","flow","flight"]
    5. 输出:"fl"
    6. 示例 2
    7. 输入:strs = ["dog","racecar","car"]
    8. 输出:""
    9. 解释:输入不存在公共前缀。
    var longestCommonPrefix = function(strs) {
                if(strs.length == 0 || strs[0] == ""){
                    return ""
                }
                var sum = "";
                var singal = "";
                for(var i=0;i<strs[0].length;i++){
                    singal = strs[0].charAt(i);
                    sum = sum + singal;
                    for(var j=0;j<strs.length;j++){
                        if(singal != strs[j].charAt(i)){
                            sum = sum.slice(0,sum.length-1);
                            return sum
                        }
                    }
                }
                return sum
    };