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