Leetcode 165 Compare Version Numbers

Compare two version numbers version1 and version2.
If version1 > version2 return 1, if version1 < version2 return ⑴, 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

摹擬，練練手，注意邊界情況，點(diǎn)可能有多個(gè)

class Solution {
public:
    int compareVersion(string version1, string version2) {
        if(version1.empty() && version2.empty()) return 0;
        if(version1.empty()) version1+="0";
        if(version2.empty()) version2+="0";
        int index1 = version1.find(".");
        int index2 = version2.find(".");
        int v11 = index1 == ⑴ ? stoi(version1) : stoi(version1.substr(0, index1));
        int v21 = index2 == ⑴ ? stoi(version2) : stoi(version2.substr(0, index2));
        if(v11 > v21) return 1;
        else if(v11 < v21) return ⑴;
        else
        {
            string s1, s2;
            if(index1 != ⑴) s1 = version1.substr(index1+1); 
            if(index2 != ⑴) s2 = version2.substr(index2+1);
            return compareVersion(s1, s2);
        }

    }
};

生活不易，碼農(nóng)辛苦
如果您覺(jué)得本網(wǎng)站對(duì)您的學(xué)習(xí)有所幫助,可以手機(jī)掃描二維碼進(jìn)行捐贈(zèng)