
代码 :
class Solution {public:string longestCommonPrefix(vector<string>& strs) {string res = "";if(strs.size() == 0)return res;// use first string as templatefor(int i = 0; i < strs[0].size(); i ++ ) {char c = strs[0][i];for(auto& str : strs) {if(i >= str.size() || str[i] != c)return res;}res += c;}return res;}};
