D. J.:

- Added the leetcode problem and solution for 165

Author: nobodyPerfecZ

README.md

@@ -180,6 +180,7 @@
 - [153 Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/)
 - [155 Min Stack](https://leetcode.com/problems/min-stack/description/)
 - [162 Find Peak Element](https://leetcode.com/problems/find-peak-element/description/)
+- [165 Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/description/)
 - [167 Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/)
 - [169 Majority Element](https://leetcode.com/problems/majority-element/description/)
 - [172 Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/description/)

awesome_python_leetcode/_165_compare_version_numbers.py

@@ -0,0 +1,35 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def compareVersion(self, version1: str, version2: str) -> int:
+        """
+        Given two version strings, version1 and version2, compare them. A version
+        string consists of revisions separated by dots '.'. The value of the revision
+        is its integer conversion ignoring leading zeros.
+
+        To compare version strings, compare their revision values in left-to-right
+        order. If one of the version strings has fewer revisions, treat the missing
+        revision values as 0.
+
+        Return the following:
+        - If version1 < version2, return -1.
+        - If version1 > version2, return 1.
+        - Otherwise, return 0.
+        """
+        numbers1 = list(map(int, version1.split(".")))
+        numbers2 = list(map(int, version2.split(".")))
+        i, j = 0, 0
+        while i < len(numbers1) or j < len(numbers2):
+            number1 = 0 if i >= len(numbers1) else numbers1[i]
+            number2 = 0 if j >= len(numbers2) else numbers2[j]
+
+            if number1 < number2:
+                return -1
+
+            if number1 > number2:
+                return 1
+
+            i += 1
+            j += 1
+
+        return 0

tests/test_165_compare_version_numbers.py

@@ -0,0 +1,17 @@
+import pytest
+
+from awesome_python_leetcode._165_compare_version_numbers import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["version1", "version2", "expected"],
+    argvalues=[
+        ("1.2", "1.10", -1),
+        ("1.01", "1.001", 0),
+        ("1.0", "1.0.0.0", 0),
+    ],
+)
+def test_func(version1: str, version2: str, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    compare = Solution().compareVersion(version1, version2)
+    assert compare == expected