LeetCode 之 Compare Version Numbers

Compare two version numbers version1 and version2.
If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.

You may assume that the version strings are non-empty and contain only digits and the . character.
The . character does not represent a decimal point and is used to separate number sequences.
For instance, 2.5 is not "two and a half" or "half way to version three", it is the fifth second-level revision of the second first-level revision.

Here is an example of version numbers ordering:

0.1 < 1.1 < 1.2 < 13.37

这个题是LeetCode简单题中通过率最低的题之一，只有16.3%。我感觉关键在于遍历时判断条件的选择上，最简单的方法如下：

int compareVersion(string version1, string version2) {
        int i=0,j=0;
        int num1=0,num2=0;
        int len1=version1.size(),len2=version2.size();
        while(i<len1||j<len2){
            if(i!=len1&&j!=len2){
                if(version1[i]!='.'){
                    <span style="color:#cc0000;">num1=num1*10+(version1[i]-'0')</span>;i++;
                }
                if(version2[j]!='.'){
                    <span style="color:#cc0000;">num2=num2*10+(version2[j]-'0')</span>;j++;
                }
                if(version1[i]=='.'&&version2[j]=='.'){
                    if(num1>num2) return 1;
                    if(num1<num2) return -1;
                    i++;j++;num1=0;num2=0;
                }
            }else if(i!=len1&&j==len2){
                if(version1[i]=='.'){
                    if(num1>num2) return 1;
                    if(num1<num2) return -1;
                    i++;num1=0;num2=0;
                }else{
                    num1=num1*10+(version1[i]-'0');i++;
                }
            }else if(i==len1&&j!=len2){
                if(version2[j]=='.'){
                    if(num1>num2) return 1;
                    if(num1<num2) return -1;
                    j++;num1=0;num2=0;
                }else{
                    num2=num2*10+(version2[j]-'0');j++;
                }
            }
        }
        if(num1>num2) return 1;
        if(num1<num2) return -1;
        return 0;

    }

只有在指针遇到 ‘.’或者 走到字符串的末尾时，进行比较。之后把中间值num1和num2置为0，然后让可以走的指针向后移位。要注意红字部分的代码，了解如何计算数值。

我这解法还很简单，运行时间比较长，我还在想如何优化。

改进代码如下，这个是看了discuss后知道的代码，关键的改进在于内部的两个循环，这样可以让指针一次性到头或者到‘.’：

int compareVersion(string version1, string version2) {
    int i = 0; 
    int j = 0;
    int n1 = version1.size(); 
    int n2 = version2.size();

    int num1 = 0;
    int num2 = 0;
    while(i<n1 || j<n2)
    {
        while(i<n1 && version1[i]!='.'){
            num1 = num1*10+(version1[i]-'0');
            i++;
        }

        while(j<n2 && version2[j]!='.'){
            num2 = num2*10+(version2[j]-'0');;
            j++;
        }

        if(num1>num2) return 1;
        else if(num1 < num2) return -1;

        num1 = 0;
        num2 = 0;
        i++;
        j++;
    }

    return 0;
}