Leetcode14: Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(strs.length==0) return "";
        if(strs.length==1) return strs[0];
        
        int ndxStr=0, ndxChar=0;
        String LCP = new String();
        while(true){
            if(ndxChar>=strs[0].length())
                return LCP;
            char c = strs[0].charAt(ndxChar);
            for(ndxStr=1; ndxStr<strs.length; ndxStr++){
                if(ndxChar>=strs[ndxStr].length() || c!=strs[ndxStr].charAt(ndxChar))
                    return LCP;                
            }
            LCP+=c;
            ndxChar++;
        }
    }
}

------------------------------------------------------------------------------------------------------------------------------------------

LL's solution:

public String longestCommonPrefix(String[] strs) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int len = strs.length;
        if(len<1)
            return "";
            
        String res = strs[0];
        for(int i=1; i<len; i++){
            String next = strs[i];
            int j = 0;
            int l = (res.length()<next.length())?res.length():next.length();
            while(j<l){
                if(res.charAt(j)!=next.charAt(j))
                    break;
                else
                    j++;
            }
            res = res.substring(0,j);
        }
        
        return res;
    }