5 lines 4ms by c++


  • -1
    X
    string longestCommonPrefix(vector<string>& strs) 
    {
    	if(strs.size()==0)  return "";
    	for(int i=0;i<strs[0].size();i++)//每一字符串位置下标
            for(int j=1;j<strs.size();j++)//第几个字符串
    			if((i>=strs[j].size())||(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.