Leetcode: Compare Version Numbers

class Solution 
{
private:
    /*
    将str以ch进行分割，结果保存在vector中返回
    */
    vector<string> split(string str, char ch)
    {
        vector<string> result;
        int index = 0;
        int count = 0;
        string substr;
        for (int i = 0; i < str.length(); i++)
        {
            if (str[i] == ch)
            {
                count = i - index;
                substr = str.substr(index, count);
                index = i + 1;
                result.push_back(substr);
            }
        }
        count = str.length()- index;
        substr = str.substr(index, count);
        result.push_back(substr);
        return result;
    }

    /*
    将vector中的string类型转换成int类型
    这里使用到了库函数stoi()
    */
    vector<int> toInt(vector<string> numbers)
    {
        int size = numbers.size();
        vector<int> intnums;
        intnums.reserve(size);
        for (int i = 0; i < size; i++)
        {
            intnums.push_back(stoi(numbers[i]));
        }
        return intnums;
    }

public:
    int compareVersion(string version1, string version2)
    {
        vector<string> strversion1 = split(version1, '.');
        vector<int> intversion1 = toInt(strversion1);

        vector<string> strversion2 = split(version2, '.');
        vector<int> intversion2 = toInt(strversion2);

        int size1 = intversion1.size();
        int size2 = intversion2.size();
        int size = size1;

        /*
        下面的ifelse是将两个vector的个数补齐，即使vector的  size是一样的，不足的补零。
        */
        if (size1 > size2)
        {
            size = size1;
            for (int i = size2; i < size; i++)
            {
                intversion2.push_back(0);
            }
        }
        else if (size1 < size2)
        {
            size = size2;
            for (int i = size1; i < size; i++)
            {
                intversion1.push_back(0);
            }
        }



        for (int i = 0; i < size; i++)
        {
            if (intversion1[i] > intversion2[i])
            {
                return 1;
            }
            else if (intversion1[i] < intversion2[i])
            {
                return -1;
            }
        }

        return 0;
    }
};