码迷,mamicode.com
首页 > 其他好文 > 详细

Longest Common Prefix

时间:2015-09-01 12:25:02      阅读:171      评论:0      收藏:0      [点我收藏+]

标签:

Description:

Write a function to find the longest common prefix string amongst an array of strings.(最长公共字串)

Code:

string merge(string&str1, string&str2)
    {
        string result="";
        int n = (str1.size()<=str2.size())?str1.size():str2.size();
        for (int i = 0; i < n; ++i)
        {
            if (str1[i]==str2[i])
                result=result+str1[i];
            else
                return result;
        }
        return result;
    }
    string longestCommonPrefix(vector<string>& strs, int start, int end)
    {
        if (start < end)
        {
            int middle = (start+end)/2;
            string str1 = longestCommonPrefix(strs, start, middle);
            if (str1=="")
                return str1;
            string str2 = longestCommonPrefix(strs, middle+1, end);
            if (str2=="")
                return str2;
            return merge(str1, str2);
        }
        else
            return strs[start];
    }
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.size()==0)
            return "";
        return longestCommonPrefix(strs,0,strs.size()-1);
    }

 

Longest Common Prefix

标签:

原文地址:http://www.cnblogs.com/happygirl-zjj/p/4775088.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!