Compare Version Numbers Problem


Description

LeetCode Problem 165.

Given two version numbers,version1 and version2, compare them.

Version numbers consist of one or more revisions joined by a dot ‘.’. Each revisionconsists of digitsand may contain leading zeros. Every revision contains at least one character. Revisions are 0-indexed from left to right, with the leftmost revision being revision 0, the next revision being revision 1, and so on. For example 2.5.33 and 0.1 are valid version numbers.

To compare version numbers, compare their revisions in left-to-right order. Revisions are compared using theirinteger value ignoring any leading zeros. This means that revisions 1 and 001 are consideredequal. If a version number does not specify a revision at an index, thentreat the revision as 0. For example, version 1.0 is less than version 1.1 because their revision 0s are the same, but their revision 1s are 0 and 1 respectively, and 0 < 1.

Return the following:

  • If version1 < version2, return -1.
  • If version1 > version2, return 1.
  • Otherwise, return 0.

Example 1:

1
2
3
Input: version1 = "1.01", version2 = "1.001"
Output: 0
Explanation: Ignoring leading zeroes, both "01" and "001" represent the same integer "1".

Example 2:

1
2
3
Input: version1 = "1.0", version2 = "1.0.0"
Output: 0
Explanation: version1 does not specify revision 2, which means it is treated as "0".

Example 3:

1
2
3
Input: version1 = "0.1", version2 = "1.1"
Output: -1
Explanation:version1's revision 0 is "0", while version2's revision 0 is "1". 0 < 1, so version1 < version2.

Example 4:

1
2
Input: version1 = "1.0.1", version2 = "1"
Output: 1

Example 5:

1
2
Input: version1 = "7.5.2.4", version2 = "7.5.3"
Output: -1

Constraints:

  • 1 <= version1.length, version2.length <= 500
  • version1 and version2only contain digits and ‘.’.
  • version1 and version2are valid version numbers.
  • All the given revisions inversion1 and version2can be stored ina32-bit integer.


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    int compareVersion(string version1, string version2) {
        for (; version1 != version2; version1 = nextSubstr(version1), version2 = nextSubstr(version2)) {
            int gap = stoi(version1) - stoi(version2);
            if (gap != 0) {
                return gap > 0 ? 1 : -1;
            }
        }
        return 0;
    }
    
    string nextSubstr(string str) {
        for (int i = 0; i < str.size(); i++) {
            if (str.at(i) == '.') {
                return str.substr(i + 1);
            }
        }
        return "0";
    }
};




Related Posts

Reverse Words In A String Problem

LeetCode 151. Given an input string s, reverse the order...

Compare Version Numbers Problem

LeetCode 165. Given two version numbers,version1 and version2, compare them....

Valid Palindrome Problem

LeetCode 125. A phrase is a palindrome if, after converting...

Remove Duplicates from Sorted List II Problem

LeetCode 82. Given the head of a sorted linked list,...

Remove Duplicates from Sorted Array II Problem

LeetCode 80. Given an integer array nums sorted in non-decreasing...

Partition List Problem

LeetCode 86. Given the head of a linked list and...