Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit ce31909

Browse files
Add a cleaner solution to 74.
1 parent 3393ca1 commit ce31909

File tree

1 file changed

+12
-8
lines changed

1 file changed

+12
-8
lines changed

‎solutions/0074.search-a-2d-matrix.js

Lines changed: 12 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -4,21 +4,25 @@
44
* @return {boolean}
55
*/
66
var searchMatrix = function (matrix, target) {
7-
let arr = [];
8-
for (let i = 0; i < matrix.length; i++) {
9-
arr = arr.concat(matrix[i]);
7+
const m = matrix.length;
8+
9+
if (m === 0) {
10+
return false;
1011
}
1112

13+
const n = matrix[0].length;
1214
let lo = 0,
13-
hi = arr.length - 1;
15+
hi = n * m - 1;
16+
1417
while (lo <= hi) {
1518
const mid = Math.floor((lo + hi) / 2);
1619

17-
if (arr[mid] === target) {
18-
return true;
19-
}
20+
let i = Math.floor(mid / n),
21+
j = mid % n;
2022

21-
if (arr[mid] > target) {
23+
if (matrix[i][j] === target) {
24+
return true;
25+
} else if (matrix[i][j] > target) {
2226
hi = mid - 1;
2327
} else {
2428
lo = mid + 1;

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /