Share a cpp solution with 7 lines of codes


  • 0
    O
    class Solution {
    public:
    string longestCommonPrefix(vector<string> &strs) {
    	if(strs.size() == 0 || strs[0].length() == 0)
    		return "";
    	for(int i = 0; i < strs[0].length(); i++)
    		for(int j = 1; j < strs.size(); j++)
    			if(i >= strs[j].length() || strs[j][i] != strs[0][i])
    			    return strs[0].substr(0, i);
    	return strs[0];
    }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.