LeetCode165. 比较版本号

class Solution {
public:
    int compareVersion(string version1, string version2) {
        int n = version1.size();
        int m = version2.size();
        int i = 0, j = 0;
        while(i < n || j < m){
            long long x = 0;    //防止越界
            while(i < n && version1[i] != '.'){
                x = x * 10 + version1[i] - '0';
                ++i;
            }
            ++i;    //跳过点号
            long long y = 0;
            while(j < m && version2[j] != '.'){
                y = y * 10 + version2[j] - '0';
                ++j;
            }
            ++j;
            if(x != y){
                return x > y ? 1 : -1;
            }
        }
        return 0;
    }
};