leetcode #437

Author: guipleite

flipBitToWin.py

@@ -3,15 +3,24 @@ def flipBitToWin(number):
     n_b = bin(number)[2:]
 
     arr = n_b.split('0')
-    l = 0
+    lenght = 0
+
+    print(arr)
 
     for i in range(len(arr)-1):
 
-        if len(arr[i]) + len(arr[i+1]) > l:
-            l = len(arr[i]) + len(arr[i+1])
+        seq = len(arr[i]) + len(arr[i+1]) + 1
+
+        if seq > lenght:
+            lenght = seq
+
+    return lenght
+
+print(flipBitToWin(1775))
 
-    l+=1
 
-    return l
+# 11011101111
 
-print(flipBitToWin(1775))
+# 11 2
+# 111 3
+# 1111 4

path-sum-iii.py

@@ -0,0 +1,34 @@
+#https://leetcode.com/problems/path-sum-iii/submissions/
+
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+
+class Solution:
+        
+    def DepthFirstSearch(self, root, sum):
+        ans = 0
+        
+        if not root:
+            return ans
+        
+        if root.val == sum:
+            ans += 1
+            
+        ans += self.DepthFirstSearch(root.left,  sum - root.val)
+        ans += self.DepthFirstSearch(root.right, sum - root.val)
+        
+        return ans
+    
+    def pathSum(self, root: 'TreeNode', sum: 'int') -> 'int':
+        
+        if not root:
+            return 0
+        
+        else:
+            ans = self.DepthFirstSearch(root, sum) + self.pathSum(root.left, sum) + self.pathSum(root.right, sum)
+        
+        return ans