240.搜索二维矩阵-ii

/*
 * @lc app=leetcode.cn id=240 lang=typescript
 *
 * [240] 搜索二维矩阵 II
 */

// @lc code=start
function searchMatrix(matrix: number[][], target: number): boolean {
	for (let i = 0; i < matrix.length; i++) {
		let row = matrix[i];

		let l = 0,
			r = row.length - 1;
		while (l <= r) {
			if (row[row.length - 1] == target) {
				return true;
			} else if (row[row.length - 1] > target) {
				let mid = Math.floor((l + r) / 2);
				if (row[mid] == target) {
					return true;
				} else if (row[mid] < target) {
					l = mid + 1;
				} else {
					r = mid - 1;
				}
			} else {
				l += 1;
			}
		}
	}
	return false;
}

console.log(searchMatrix([[-5]], -5));

// @lc code=end