more python solution

Author: lazybing

python/leetcode11_container_with_most_water/solution.py

@@ -0,0 +1,24 @@
+#Brute Force 
+class Solution:
+    def maxArea(self, height:List[int])->int:
+        maxarea = 0
+
+        for i in range(0, len(height), 1):
+            for j in range(i + 1, len(height), 1):
+                maxarea = max(maxarea, min(height[i], height[j]) * (j - i))
+
+        return maxarea
+
+# Two pointer Approach
+class Solution:
+    def maxArea(self, height:List[int])->int:
+        #init the param
+        left, right, width, res = 0, len(height) - 1, len(height) - 1, 0
+        for w in range (width, 0, -1):
+            if height[left] < height[right]:
+                res, left = max(res, height[left] * w), left + 1
+            else:
+                res, right = max(res, height[right] * w), right - 1
+
+        return res
+

python/leetcode141_linked_list_cycle/solution.py

@@ -0,0 +1,43 @@
+# Definition for singly-linked list.
+# class ListNode:
+#   def __init__(self, x):
+#       self.val = x
+#       self.next = None
+
+# solution using set
+class Solution:
+    def hasCycle(self, haed:ListNode)->bool:
+        # check the input param
+        if head is None:
+            return False
+
+        node_set = {}
+        while head.next:
+            node_set[head] = True
+            if head.next in node_set:
+                return True
+            head = head.next
+
+        return False
+
+# solution using two pointer
+class Solution:
+    def hasCycle(self, head:ListNode)->bool:
+        # check the input param
+        if head == None or head.next == None:
+            return False
+
+        pslow = pfast = head
+        while pfast != None and pfast.next != None:
+            pslow = pslow.next
+            pfast = pfast.next.next
+            if pfast == pslow:
+                break
+
+        if pfast == None or pfast.next == None:
+            return False
+        elif pfast == pslow:
+            return True
+
+        return False
+

python/leetcode167_two_sum_ii/solution.py

@@ -1,3 +1,12 @@
+class Solution:
+    def twoSum(self, number:List[int], target: int)->List[int]:
+        for i in range (0, len(numbers), 1):
+            for j in range (i + 1, len(numbers), 1):
+                if numbers[i] + numbers[j] == target:
+                    return [i + 1, j + 1]
+
+        return []
+
 class Solution:
     """
     " type namber: List[int]