edit 4 solutions

Author: Jack

.gitignore

@@ -0,0 +1,91 @@
+.idea/
+
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+env/
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+*.egg-info/
+.installed.cfg
+*.egg
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*,cover
+.hypothesis/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+target/
+
+# IPython Notebook
+.ipynb_checkpoints
+
+# pyenv
+.python-version
+
+# celery beat schedule file
+celerybeat-schedule
+
+# dotenv
+.env
+
+# virtualenv
+venv/
+ENV/
+
+# Spyder project settings
+.spyderproject
+
+# Rope project settings
+.ropeproject

Python/compare-version-numbers.py

@@ -17,6 +17,8 @@
 # 
 # 0.1 < 1.1 < 1.2 < 13.37
 #
+import itertools
+
 
 class Solution(object):
     def compareVersion(self, version1, version2):
@@ -44,6 +46,8 @@ def compareVersion(self, version1, version2):
 
 # Time:  O(n)
 # Space: O(n)
+
+
 class Solution2(object):
     def compareVersion(self, version1, version2):
         """
@@ -69,6 +73,31 @@ def compareVersion(self, version1, version2):
 
         return 0
 
+    def compareVersion2(self, version1, version2):
+        """
+        :type version1: str
+        :type version2: str
+        :rtype: int
+        """
+        v1 = [int(x) for x in version1.split('.')]
+        v2 = [int(x) for x in version2.split('.')]
+        while len(v1) != len(v2):
+            if len(v1) > len(v2):
+                v2.append(0)
+            else:
+                v1.append(0)
+        return cmp(v1, v2)
+
+    def compareVersion3(self, version1, version2):
+        splits = (map(int, v.split('.')) for v in (version1, version2))
+        return cmp(*zip(*itertools.izip_longest(*splits, fillvalue=0)))
+
+    def compareVersion4(self, version1, version2):
+        main1, _, rest1 = ('0' + version1).partition('.')
+        main2, _, rest2 = ('0' + version2).partition('.')
+        return cmp(int(main1), int(main2)) or len(rest1 + rest2) and self.compareVersion4(rest1, rest2)
+
+
 if __name__ == "__main__":
     print Solution().compareVersion("21.0", "121.1.0")
     print Solution().compareVersion("01", "1")

Python/reverse-integer.py

@@ -35,7 +35,28 @@ def reverse(self, x):
             x /= 10
         return result if result <= 0x7fffffff else 0  # Handle overflow.
 
-    
+    def reverse2(self, x):
+        """
+        :type x: int
+        :rtype: int
+        """
+        if x < 0:
+            x = int(str(x)[::-1][-1] + str(x)[::-1][:-1])
+        else:
+            x = int(str(x)[::-1])
+        x = 0 if abs(x) > 0x7FFFFFFF else x
+        return x
+
+    def reverse3(self, x):
+        """
+        :type x: int
+        :rtype: int
+        """
+        s = cmp(x, 0)
+        r = int(`s * x`[::-1])
+        return s * r * (r < 2 ** 31)
+
+
 if __name__ == "__main__":
     print Solution().reverse(123)
     print Solution().reverse(-321)

Python/single-number.py

@@ -9,11 +9,14 @@
 
 import operator
 
+
 class Solution:
-    # @param A, a list of integer
-    # @return an integer
+    """
+    :type nums: List[int]
+    :rtype: int
+    """
     def singleNumber(self, A):
         return reduce(operator.xor, A)
 
 if __name__ == '__main__':
-    print Solution().singleNumber([1, 1, 2, 2, 3])
+    print Solution().singleNumber([1, 1, 2, 2, 3])

Python/two-sum.py

@@ -12,6 +12,7 @@
 # Because nums[0] + nums[1] = 2 + 7 = 9,
 # return [0, 1].
 
+
 class Solution(object):
     def twoSum(self, nums, target):
         """
@@ -26,6 +27,20 @@ def twoSum(self, nums, target):
             lookup[num] = i
         return []
 
+    def twoSum2(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        k = 0
+        for i in nums:
+            j = target - i
+            k += 1
+            tmp_nums = nums[k:]
+            if j in tmp_nums:
+                return [k - 1, tmp_nums.index(j) + k]
+
 
 if __name__ == '__main__':
-    print "index1=%d, index2=%d" % Solution().twoSum((2, 7, 11, 15), 9)
+    print Solution().twoSum((2, 7, 11, 15), 9)