[LeetCode] 74. Search a 2D Matrix - 문제풀이
Description 행>렬 순서대로 정렬된 2차원 배열(행렬)에서 주어진 target값을 찾는 문제입니다. 값이 없을 경우 false를 반환해주시면 됩니다. Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from left to right. The first integer of each row is greater than the last integer of the previous row. Example 1: Input: matrix = [[1,3,5,7],[10,11,16,20],[23,..
