LeetCode - 7. Reverse Integer

Author: tahmid-tanzim

lowest-common-ancestor-of-a-binary-tree.py

@@ -74,12 +74,9 @@ def lowestCommonAncestor(root: TreeNode, descendantOne: TreeNode, descendantTwo:
 
 
 if __name__ == '__main__':
-    # tree_array = [3, 5, 1, 6, 2, 0, 8, None, None, 7, 4]
-    # p = 5
-    # q = 4
-    tree_array = [1, 2]
-    p = 1
-    q = 2
+    tree_array = [3, 5, 1, 6, 2, 0, 8, None, None, 7, 4]
+    p = 5
+    q = 4
     root_node, descendantNode = create_binary_tree(tree_array, p, q)
     lca = lowestCommonAncestor(root_node, descendantNode['p'], descendantNode['q'])
     print('LCA - ', lca.val)

reverse-integer.py

@@ -0,0 +1,22 @@
+#!/usr/bin/python3
+# https://leetcode.com/problems/reverse-integer/
+
+
+def reverse(x: int) -> int:
+    result = 0
+    remainder = abs(x)
+    while remainder != 0:
+        result *= 10
+        result += remainder % 10
+        remainder //= 10
+    if result > 2 ** 31:
+        return 0
+    return result if x >= 0 else -result
+
+
+if __name__ == '__main__':
+    # print('123 | ', reverse(123))
+    # print('-123 | ', reverse(-123))
+    # print('120 | ', reverse(120))
+    # print('0 | ', reverse(0))
+    print('1534236469 | ', reverse(1534236469), 9646324351)