leetCode #14 Longest Common Prefix

题目：找到一堆字符串中的最长公共前缀

分析：遍历一遍比较

答案：

class Solution {
public:
	string longestCommonPrefix(vector<string> &strs) {
		if (strs.empty())
			return "";

		// to find shortest size
		int minSize = strs[0].size();
		for (int i = 0; i < strs.size(); i++)
		{
			if (strs[i].size() < minSize)
				minSize = strs[i].size();
		}

		
		for (int j = 0; j < minSize; j++)
			for (int i = 0; i < strs.size(); i++)
			{
				if (strs[i][j] != strs[0][j])
					return strs[0].substr(0, j);
			}
		return strs[0].substr(0, minSize);
	}
};