LeetCode-14-Longest Common Prefix(Number/Vector/String)-Easy

class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.size()==0){
return "";
}

string ans="";
int index=0;
char c;
vector<string>::iterator iter=strs.begin();

while(1){
string s=*iter;
//cout<<"s= "<<s<<endl;

if(index>=s.length()){
break;
}

if(iter==strs.begin()){
c=s[index];
}else{
if(c!=s[index]){
break;
}
}

iter++;
if(iter==strs.end()){
iter=strs.begin();
ans+=c;
index++;
}
}

return ans;
}
};