leetcode 14 Longest Common Prefix

leetcode 14 Longest Common Prefix

#include <string>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.empty())
            return "";
        int size = strs.size();
        string prefix = strs[0];//strs中的每一个字符串都比最长前缀要长，或者等于最长前缀，假定最长前缀是第一个字符串，一一比较，不等于的字符就删掉
        for (int i = 1; i < size; i++){
            if (prefix.empty() || strs[i].empty())
                return "";

            int steplength = max(prefix.length(), strs[i].length());
            int j = 0;
            for (j; j < steplength; j++)
            {
                if (prefix[j] != strs[i][j])
                    break;
            }
            prefix = prefix.substr(0, j);//从第0位开始，长度为j的字符串
        }
        return prefix;
    }
};