题解 | #最长公共前缀#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param strs string字符串vector 
     * @return string字符串
     */
    string longestCommonPrefix(vector<string>& strs) {
        // write code here
        string res;
        if (strs.size() == 0)
            return res;
        if (strs.size() == 1)
            return strs[0];

        int min = strs[0].size();
        for (auto it : strs)
        {
            if (it.size() < min)
            {
                min = it.size();
            }
        }

        
        for (int i = 0; i < strs.size(); i++)
        {
            for (int j = 0; j < min; j++)
            {
                
            }
        }

        for (int i = 0; i < min; i++)
        {
            char tmp = strs[0][i];
            int j = 1;
            for (; j < strs.size(); j++)
            {
                if (tmp == strs[j][i])
                {
                    continue;
                }
                else
                {
                    break;
                }
            }
            if (j == strs.size())
            {
                res += tmp;
            }
        }

        return res;
    }
};