Javascript Solution For LeetCode Problem: Search a 2D Matrix
Solving Search a 2D Matrix in Javascript. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
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, 30, 34, 50] ] target = 3 Output: true
Example 2:
Input: matrix = [ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ] target = 13 Output: false
See the full details of the problem Search a 2D Matrix at LeetCode
Originally posted at: @github.com/ignacio-chiazzo/Algorithms-Leetcode-Javascript
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.