Leetcode 14. Longest Common Prefix

 

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

 

 

 

vector<string> strs 中可以使用形如strs[i][j]方式访问，很有意思。

 

string longestCommonPrefix(vector<string>& strs) 
{
	string s="";
	if(strs.size()==0)
		return s;
	int flag=0;
	char c;
	for(int i=0;i<strs[0].length();i++)
	{
		c=strs[0][i];
		for(int j=1;j<strs.size();j++)
		{
			if(strs[j][i]!=c)
			{
				flag=1;
				break;
			}
		}
		if(flag)
			break;
		else
			s+=c;
	}
	return s;        
}