要求:比大小
思路:
class Solution {
public:
int compareVersion(string v1, string v2) {
int i = 0, j = 0;
while(i < v1.size() || j < v2.size())
{
long long num1 = 0, num2 = 0; //数据加强了,这里要用long long
while(i < v1.size() && v1[i] != '.') num1 = num1 * 10 + v1[i++] - '0';
while(j < v2.size() && v2[j] != '.') num2 = num2 * 10 + v2[j++] - '0';
if(num1 > num2) return 1;
else if( num1 < num2) return -1;
i++,j++;
}
return 0;
}
};