Leetcode——14.最长公共前缀

题目：

给出一个String数组strs，要求用户找出该数组中的最长公共前缀，例如：

strs = ["abc", "abcd", "abcde"]=>"abc";

strs = ["abcde", "acde", "apiuy"]=>"a";

strs = ["abc", "de", "poiuy"]=>"";

思路：

递归求解，将strs从中间分开，依次求解左边和右边的最长公共前缀，然后再比较

代码：

public  static String longestCommonPrefix(String[] strs) {
        if(strs == null || strs.length == 0){
            return "";
        }
        int mid = (strs.length-1)/2;
        String lstr = midLongest(strs, 0, mid);
        String rstr = midLongest(strs, mid+1, strs.length-1);
        String com = compare(lstr, rstr);
        return com;
    }

    private static String compare(String lstr, String rstr) {
        int min = Math.min(lstr.length(), rstr.length());
        StringBuilder sbu = new StringBuilder();
        for(int i = 0; i < min; i++){
            if(lstr.charAt(i) == rstr.charAt(i)){
                sbu.append(lstr.charAt(i));
            }else{
                break;
            }
        }
        return sbu.toString();
    }

    private static String midLongest(String[] strs, int left, int right) {
        if(left >= right){
            return strs[right];
        }
        int mid = (left + right) / 2;
        String lstr = midLongest(strs, left, mid);
        String rstr = midLongest(strs, mid + 1, right);
        String com = compare(lstr, rstr);
        return com;

    }