leetcode6:Longest Common Prefix

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

 

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        string s;
        if( strs.size()<1) return s;
        if( strs.size()==1) {s=strs[0]; return s;}

        s = "";
        for(int i=0; i!= strs[0].size(); ++i){
            const char c = strs[0][i];
            
            for(int j=0; j!= strs.size(); ++j) {
                if( i >= strs[j].size() || strs[j][i] != c) return s;
                
            }
            
            s.push_back( c );
        }
        
        return s;
    }
};


 

posted @ 2012-12-21 05:38  西施豆腐渣  阅读(94)  评论(0编辑  收藏  举报