class Solution {
    
    
    public static String longestCommonPrefix(String[] strs) {
    
    
        String result = "";
        int len = strs.length;
        if (len <= 0)
            return result;
        int minstringlen=strs[0].length();//所有字符串的最小length,初始化为第一个字符串的长度
        for(int i=1;i<len;i++){
    
    
            minstringlen=Math.min(minstringlen,strs[i].length());
        }
        for (int i = 0; i < minstringlen; i++) {
    
    //不能是小于strs[0].length()，应该小于minstringlen，即所有字符串的最小length
            boolean flag=true;
            char char1 = strs[0].charAt(i);
            for (int l = 1; l < len; l++) {
    
                 
                if (strs[l].charAt(i) != char1)
                   flag = false;
            }
            if (flag == true) //历完所有的字符串，没有发生不匹配
                result = result + char1;
            else
               //return result;     //7%,5%
                break; 
        }
        return result;
    }
}