Longest Common Prefix

 

Q:

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

 

A:

太简单,太困,直接贴代码

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (strs.empty()) return string("");
        string prefix = strs[0];
        int i = 0;
        for (; i < prefix.length(); ++i) {
            for (int j = 0; j < strs.size(); ++j) {
                if (prefix[i] != strs[j][i]) return prefix.substr(0, i);
            }
        }
        return prefix;
    }
};

 

posted @ 2013-06-17 23:52  dmthinker  阅读(88)  评论(0)    收藏  举报