class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
if len(matrix) == 0:
return False
if len(matrix[0]) == 0:
return False
start = 0
end = len(matrix) -1
value = -1
while start<= end:
mid = (start+end)//2
if matrix[mid][0] <= target:
value = mid
start = mid +1
else:
end = mid-1
print(value)
if value==-1:
return False
start = 0
end = len(matrix[value]) -1
while start<= end:
mid = (start+end)//2
if matrix[value][mid] == target:
return True
elif matrix[value][mid] < target:
start = mid+1
else:
end = mid-1
return False
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |