14. Longest Common Prefix

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

If there is no common prefix, return an empty string “”.

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

class Solution {
    public String longestCommonPrefix(String[] strs) {
        if(strs.length == 0)
            return "";  
        char[] str = strs[0].toCharArray();  
        int Min = str.length;  
        for(int i = 1;i < strs.length;i++){  
            char[] s = strs[i].toCharArray();  
            int j = 0;  
            while(j < Min && j < s.length && s[j] == str[j])
                j++;  
            Min = Min > j?j:Min;  
        }  
        return strs[0].substring(0,Min);  
    }
}