Longest Common Prefix

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        int min_size = Integer.MAX_VALUE;
        int n = strs.length;
        if(n == 0){
            return "";
        }
        for(int i = 0;i < n;i++){
            //若存在空串则返回"";
            if(strs[i].length() == 0){
                return "";
            }
            if(strs[i].length()<min_size){
                min_size = strs[i].length();//求得最短串的长度
            }
        }
        String re="";
        for(int j = 0;j < min_size;j++){
            char c = strs[0].charAt(j);
            for(int k = 0;k < n;k++){
                if(strs[k].charAt(j)!=c){
                    return re;
                }
            }
            re = re+c;
        }
        return re;
        
    }
}