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

cases: 

     "1.0.1" - "1"   return 1

     "01" - "1"       return 0

     "1.10" - "1.1" return 1

思路：对字符串string s（比如：“1.0.1”）根据最左侧 '.’ 拆分成两部分“1”和“0.1”，记做sInt和sFrac。对version1和version2进行相同拆分操作，(v1Int,v1Frac)和(v2Int,v2Frac)。如果v1Int == v2Int,则v1Frac和v2Frac进行递归比较compareVersion(v1Frac,v2Frac)；否则结束比较。

class Solution {
public:
    int compareVersion(string version1, string version2) {
        string v1IntStr, v2IntStr;
        
        string::size_type pos1 = version1.find(".");
        v1IntStr = version1.substr(0, (int)pos1);
        string::size_type pos2 = version2.find(".");
        v2IntStr = version2.substr(0, (int)pos2);
        
        long long v1Int = stoll(v1IntStr), v2Int = stoll(v2IntStr);
        if (v1Int > v2Int)
            return 1;
        else if (v1Int == v2Int){
            string newV1 = pos1 < version1.length()? version1.substr(pos1 + 1): "0";
            string newV2 = pos2 < version2.length()? version2.substr(pos2 + 1): "0";
            if (newV1 == newV2) return 0;
            return compareVersion(newV1, newV2);
        }
        else
            return -1;
    }
};