solve problem Compare Version Numbers

Author: P-ppc

README.md

@@ -306,6 +306,7 @@ All solutions will be accepted!
 |797|[All Paths From Source To Target](https://leetcode-cn.com/problems/all-paths-from-source-to-target/description/)|[java/py/js](./algorithms/AllPathsFromSourceToTarget)|Medium|
 |789|[Escape The Ghosts](https://leetcode-cn.com/problems/escape-the-ghosts/description/)|[java/py/js](./algorithms/EscapeTheGhosts)|Medium|
 |701|[Insert Into A Binary Search Tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/description/)|[java/py/js](./algorithms/InsertIntoABinarySearchTree)|Medium|
+|165|[Compare Version Numbers](https://leetcode-cn.com/problems/compare-version-numbers/description/)|[java/py/js](./algorithms/CompareVersionNumbers)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/CompareVersionNumbers/README.md

@@ -0,0 +1,2 @@
+# Compare Version Numbers
+This problem is easy to solve

algorithms/CompareVersionNumbers/Solution.java

@@ -0,0 +1,26 @@
+class Solution {
+    public int compareVersion(String version1, String version2) {
+        String[] version1Splits = version1.split("\\."),
+                 version2Splits = version2.split("\\.");
+        int minLength = Math.min(version1Splits.length, version2Splits.length),
+            maxLength = Math.max(version1Splits.length, version2Splits.length);
+        
+        for (int i = 0; i < minLength; i++) {
+            if (Integer.valueOf(version1Splits[i]) > Integer.valueOf(version2Splits[i]))
+                return 1;
+            else if (Integer.valueOf(version1Splits[i]) < Integer.valueOf(version2Splits[i]))
+                return -1;
+        }
+        
+        if (minLength == maxLength) 
+            return 0;
+        
+        String[] splits = version1Splits.length > version2Splits.length ? version1Splits : version2Splits;
+        for (int i = minLength; i < maxLength; i++) {
+            if (Integer.valueOf(splits[i]) > 0)
+                return version1Splits.length > version2Splits.length ? 1 : -1;
+        }
+        
+        return 0;
+    }
+}

algorithms/CompareVersionNumbers/solution.js

@@ -0,0 +1,31 @@
+/**
+ * @param {string} version1
+ * @param {string} version2
+ * @return {number}
+ */
+var compareVersion = function(version1, version2) {
+    let versions1 = version1.split('.').map(v => parseInt(v)),
+        versions2 = version2.split('.').map(v => parseInt(v))
+    
+    while (versions1.length > 0 && versions1[versions1.length - 1] == 0)
+        versions1.pop()
+    while (versions2.length > 0 && versions2[versions2.length - 1] == 0)
+        versions2.pop()
+    
+    let length1 = versions1.length,
+        length2 = versions2.length
+    
+    for (let i = 0; i < Math.min(length1, length2); i++) {
+        if (versions1[i] > versions2[i])
+            return 1
+        else if (versions1[i] < versions2[i])
+            return -1
+    }
+    
+    if (length1 > length2)
+        return 1
+    else if (length1 < length2)
+        return -1
+    else
+        return 0
+};

algorithms/CompareVersionNumbers/solution.py

@@ -0,0 +1,30 @@
+class Solution(object):
+    def compareVersion(self, version1, version2):
+        """
+        :type version1: str
+        :type version2: str
+        :rtype: int
+        """
+        versions1 = [int(v) for v in version1.split('.')]
+        versions2 = [int(v) for v in version2.split('.')]
+        
+        while len(versions1) > 0 and versions1[-1] == 0:
+            versions1.pop()
+        while len(versions2) > 0 and versions2[-1] == 0:
+            versions2.pop()
+        
+        length1 = len(versions1)
+        length2 = len(versions2)
+        
+        for i in xrange(min(length1, length2)):
+            if versions1[i] > versions2[i]:
+                return 1
+            elif versions1[i] < versions2[i]:
+                return -1
+        
+        if length1 > length2:
+            return 1
+        elif length1 < length2:
+            return -1
+        else:
+            return 0