题目链接:click~
/*题意:求一串单词的公共前缀*/
/**
*思路:比较每个单词的第i位,直到不同
*/
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string s;
if(strs.size() == 0) return s;
int n = strs.size();
int index = 0, i;
for(; ; index++) {
if(strs[0].size() <= index) break;
for(i = 1; i < n; i ++) {
if(strs[0][index] != strs[i][index])
break;
}
if(i != n) break;
s = s+strs[0][index];
}
return s;
}
};