tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.2 KiB
1.2 KiB
TODO 0074. Search a 2D Matrix medium
You are given an m x n integer matrix matrix with the following two properties:
- Each row is sorted in non-decreasing order.
- The first integer of each row is greater than the last integer of the previous row.
Given an integer target, return true if target is in matrix or false otherwise.
You must write a solution in O(log(m * n)) time complexity.
Example 1:
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: trueExample 2:
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: falseConstraints:
m == matrix.lengthn == matrix[i].length1 <= m, n <= 100-10^{4} <= matrix[i][j], target <= 10^{4}
TODO Approach
Write your approach here.
TODO Python
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:TODO C++
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
}
};