014 最长公共前缀

LeetCode 第十四题 最长公共前缀

编写一个函数来查找字符串数组中最长的公共前缀字符串。
这道题目的意思是，输入多个字符串，查找这多个字符串的公共前缀。在这里我们参考了解答中的解题方法，共使用了四种方法。

方法一

Java

    public static String longestCommonPrefix(String[] strs) {
        if (strs.length == 0)
            return "";
        String prefix = strs[0];
        for (int i = 0; i < strs.length; i++) {
            while (strs[i].indexOf(prefix) != 0) {
                prefix = prefix.substring(0, prefix.length() - 1);
                if (prefix.isEmpty())
                    return "";
            }
        }
        return prefix;
    }

Python

class Solution(object):
    def longestCommonPrefix(self, strs):
        if not strs:
            return ""
        prefix = strs[0]
        for i in range(1, len(strs)):
            while (strs[i].find(prefix) != 0):
                prefix = prefix[0:len(prefix) - 1]
                if not prefix:
                    return ""
        return prefix

C++

    string longestCommonPrefix(vector<string>& strs)
    {
        if(strs.size()==0)return "";
        string prefix = strs[0];
        for(int i=0; i<strs.size(); i++)
        {
            while(strs[i].find(prefix)!=NULL)
            {
                prefix = prefix.substr(0, prefix.size()-1);
                if(prefix.size()==0)return "";
            }
        }
        return prefix;
    }

方法二

Java

    public static String longestCommonPrefix(String[] strs) {
        if (strs.length == 0)
            return "";
        for (int i = 0; i < strs[0].length(); i++) {
            char c = strs[0].charAt(i);
            for (int j = 1; j < strs.length; j++) {
                if (i == strs[j].length() || strs[j].charAt(i) != c)
                    return strs[0].substring(0, i);
            }
        }
        return strs[0];
    }

Python

    def longestCommonPrefix(self, strs):
        if not strs:
            return ""
        minLength = len(strs[0])
        for str in strs:
            minLength = min(minLength, len(str))
        for i in range(minLength):
            c = strs[0][i]
            for j in range(len(strs)):
                if c != strs[j][i]:
                    return strs[0][0:i]
        return strs[0][0:minLength]

C++

    string longestCommonPrefix(vector<string>& strs)
    {
        if(strs.size()==0) return "";
        for(int i=0; i<strs[0].length(); i++)
        {
            char c = strs[0][i];
            for(int j=0; j<strs.size(); j++)
            {
                if(i==strs[j].length()||strs[j][i]!=c)
                {
                    return strs[0].substr(0,i);
                }
            }
        }
        return strs[0];
    }

方法三

Java

    public static String longestCommonPrefix(String[] strs) {
        if (strs.length == 0)
            return "";
        return longestCommonPrefix(strs, 0, strs.length - 1);
    }

    private static String longestCommonPrefix(String[] strs, int left, int right) {
        if (left == right)
            return strs[left];
        else {
            int mid = (left + right) / 2;
            String lcpLeft = longestCommonPrefix(strs, left, mid);
            String lcpRight = longestCommonPrefix(strs, mid + 1, right);
            return commonPrefix(lcpLeft, lcpRight);
        }
    }

    private static String commonPrefix(String left, String right) {
        int min = Math.min(left.length(), right.length());
        for (int i = 0; i < min; i++) {
            if (left.charAt(i) != right.charAt(i))
                return left.substring(0, i);
        }
        return left.substring(0, min);
    }

Python

    def longestCommonPrefix(self, strs):
        if not strs:
            return ""
        return self.longestCommonPrefix(strs, 0, len(strs) - 1)

    def longestCommonPrefix(self, strs, left, right):
        if left == right:
            return strs[left]
        else:
            mid = int((left + right) / 2)
            lcpLeft = self.longestCommonPrefix(strs, left, mid)
            lcpRight = self.longestCommonPrefix(strs, mid + 1, right)
            result = self.commonPrefix(lcpLeft, lcpRight)
            return result

    def commonPrefix(self, left, right):
        for i in range(min(len(left), len(right))):
            if (left[i] != right[i]):
                return left[0:i]
        return left[0:min(len(left), len(right))]

C++

    string longestCommonPrefix(vector<string>& strs)
    {
        if(strs.size()==0)
            return "";
        return longestCommonPrefix(strs, 0, strs.size()-1);
    }

private:
    string longestCommonPrefix(vector<string>& strs, int left, int right)
    {
        if(left==right)
        {
            return strs[left];
        }
        else
        {
            int mid = (left+right)/2;
            string lcpLeft = longestCommonPrefix(strs,left,mid);
            string lcpRighr = longestCommonPrefix(strs,mid+1,right);
            return CommonPrefix(lcpLeft,lcpRighr);
        }
    }

    string CommonPrefix(string left,string right)
    {
        for(int i=0; i<min(left.length(),right.length()); i++)
        {
            if(left[i]!=right[i])
                return left.substr(0,i);
        }
        return left.substr(0,min(left.length(),right.length()));
    }

方法四

Java

    public static String longestCommonPrefix(String[] strs) {
        if (strs.length == 0)
            return "";
        int minLen = Integer.MAX_VALUE;
        for (String str : strs)
            minLen = Math.min(minLen, str.length());
        int low = 0;
        int high = minLen;
        while (low <= high) {///注意是 <= 
            int middle = (low + high) / 2;
            if (isCommonPrefix(strs, middle))
                low = middle + 1;
            else
                high = middle - 1;
        }
        return strs[0].substring(0, (low + high) / 2);
    }

    private static boolean isCommonPrefix(String[] strs, int len) {
        String str1 = strs[0].substring(0, len);
        for (int i = 0; i < strs.length; i++) {
            if (!strs[i].startsWith(str1))
                return false;
        }
        return true;
    }

Python

    def longestCommonPrefix(self, strs):
        if not strs:
            return ""
        minLen = len(strs[0])
        for str in strs:
            minLen = min(minLen, len(str))
        if minLen==0:
            return ""
        low, high = 0, minLen
        while (low <= high):
            middle = int((low + high) / 2)
            if (self.isCommonPrefix(strs, middle)):
                low = middle + 1
            else:
                high = middle - 1
        return strs[0][0:int((low + high) / 2)]

    def isCommonPrefix(self, strs, length):
        length = length - 1
        c = strs[0][length]
        for str in strs:
            if str[length] != c:
                return False
        return True

C++

    string longestCommonPrefix(vector<string>& strs)
    {
        if(strs.size()==0)
            return "";
        int minLen = strs[0].length();
        for(int i=1; i<strs.size(); i++)
        {
            int current_len = strs[i].length();
            minLen = min(minLen, current_len);
        }
        int low=0, high=minLen;
        while(low<=high)
        {
            int middle = (low + high)/2;
            if(isCommonPrefix(strs,middle))
                low = middle+1;
            else
                high = middle-1;
        }
        return strs[0].substr(0,(low+high)/2);
    }

private:
    bool isCommonPrefix(vector<string>& strs, int len)
    {
        len = len-1;
        char c = strs[0][len];
        for(int i=1; i<strs.size(); i++)
        {
            if(strs[i][len]!=c)
                return false;
        }
        return true;
    }