- C++
class Solution { public: string longestCommonPrefix(vector<string>& strs) { if(strs.size()==0){return "";} string res = ""; int size = strs.size(); int length = strs[0].length(); for(int i=1;i<size;i++){ if(length>strs[i].length()){ length = strs[i].length(); } } for(int i=0;i<length;i++){ char target = strs[0][i]; bool mark = false; for(int j=0;j<size;j++){ if(strs[j][i]!=target){ mark = true; break; } } if(mark){ break; } res += target; } return res; } };
09-20
09-20