Longest Common Prefix 最长公共前缀

class Solution {

public:

string longestCommonPrefix(vector<string> &strs) {

int n=strs.size();

if(n==0) return"";

int length=INT_MAX;

string result="";

for(int i=0;i<n;i++)

{

if(strs[i].size()<length)

{

length=strs[i].size();

}

}

for(int j=0;j<length;j++)

{

int i=0;

for( i=0;i<strs.size();i++)

{

if(strs[i][j]!=strs[0][j])

break;

}

if(i==strs.size())

result+=strs[0][j];

else break;

}

return result;

}

};