题解 | #比较版本号#简单的双指针遍历法

#include <algorithm>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 比较版本号
     * @param version1 string字符串 
     * @param version2 string字符串 
     * @return int整型
     */
    int compare(string version1, string version2) {
        int num1 = 0;
        int num2 = 0;
        int i1 = 0;
        int i2 = 0;
        while (i1<version1.size() || i2<version2.size()) {
            long long num1 =0;
            while (i1<version1.size()&&version1[i1]!='.') {
                num1 = num1 * 10 + int((version1[i1] - '0'));
                i1++;
            }
            i1++;
            long long num2 =0;
            while (i2<version2.size()&&version2[i2]!='.') {
                num2 = num2 * 10 + int((version2[i2] - '0'));
                i2++;
            }
            i2++;
                if (num1>num2) {
                    return 1;
                }
                if (num1<num2) {
                    return -1;
                }
               
            }
        // write code here
         return 0;
    }
};