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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(strs == null || strs.length == 0 || strs[0] == null || strs[0].length() == 0) return "";
        for(int i = 0; i < strs[0].length(); i ++){
            char c = strs[0].charAt(i);
            for(int j = 0; j < strs.length; j ++){
                if(!(strs[j].length() > i && strs[j].charAt(i) == c)){
                    return strs[0].substring(0, i);
                }
            }
        }
        return strs[0];
    }
}