Add Python 13 14 15 solution

Author: qinyii

Problems/13-Max-Consecutive-Ones-III/Max_consecutive_ones_III.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def longestOnes(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: int
+        """
+        left    ,right = 0,0
+        res = 0
+        while(right<len(nums)):
+            if(nums[right] == 0):
+                k-=1
+            right+=1
+            while(k<0):
+                if(nums[left]==0):
+                    k+=1
+                left+=1
+            res = max(res,right-left)
+        return res

Problems/14-Search-a-2D-Matrix/search_a_2D_Matrix.py

@@ -0,0 +1,15 @@
+class Solution(object):
+    def searchMatrix(self, matrix, target):
+        """
+        :type matrix: List[List[int]]
+        :type target: int
+        :rtype: bool
+        """
+        k = 0
+        
+        for i in range(len(matrix)):
+            if(target ==  matrix[i][0]): return True
+            if(target>  matrix[i][0]): k = i   
+        for j in range(1,len(matrix[k])):
+            if(target == matrix[k][j]): return True
+        return False

Problems/15-Maximum-Tastiness-of-Candy-Basket/Max_Tastiness_of_Candy.py

@@ -0,0 +1,23 @@
+class Solution(object):
+    def maximumTastiness(self, price, k):
+        """
+        :type price: List[int]
+        :type k: int
+        :rtype: int
+        """
+        price.sort()
+        def check(d):
+            cnt, x0 = 1, price[0]
+            for x in price:
+                if x -  x0 >= d:
+                    cnt += 1
+                    x0 = x
+            return cnt >= k
+
+        left = 0
+        right = price[-1]-price[0]
+        while(left < right):
+            mid = (left+right+1)//2
+            if check(mid): left = mid
+            else: right = mid-1
+        return left