最长公共前缀

输入：strs = ["flower","flow","flight"]
输出："fl"

输入：strs = ["dog","racecar","car"]
输出：""
解释：输入不存在公共前缀。

#include <stdio.h>
#include <iostream>
using namespace std;
#include <vector>
 string longestCommonPrefix(vector<string>& strs);
string longestCommonPrefix(vector<string>& strs) {
		string ans;
		if(strs.empty() )return ans;
		int idx=0;
		while(1){
			if(strs[0].empty())return ans;
			char check=strs[0][idx];
			int find=1;
			for(int i=0;i<strs.size();i++){
				if(idx>=strs[i].size()){
					find=0;
					break;
				}
				if(strs[i][idx]!=check){
					find=0;
					break;
				}

			}
							idx++;
				if(find==1)ans+=check;
				else break;
		}
		return  ans;
		//return  strs[1];
    }
int main(void) {
	string str[100]={"flower","flow","flight"};
	//vector<string> strs{"flower","flow","flight"};
	vector<string> strs(str,str+3);
	string s=longestCommonPrefix(strs);
	cout<<"输出是"<<s<<endl;
    return 0;
}