leetcode - Longest Common Prefix

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

class Solution {
public:
    std::string longestCommonPrefix(std::vector<std::string> &strs) {
		if(strs.size() == 0) return "";
		std::string s(strs[0]);
		for(int i = 1; i < strs.size(); i++)
		{
			if(s.size() == 0 || strs[i].size() == 0) return "";
			int sz = s.size() > strs[i].size() ? s.size() : strs[i].size();
			int j;
			for(j = 0; j < sz; j++)
			{
				if(s[j] != strs[i][j]) break;
			}
			s = s.substr(0,j);
		}
		return s;
    }
};