forked from jyxia/LeetCode-JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path74-search2DMatrix.js
54 lines (49 loc) · 1.39 KB
/
74-search2DMatrix.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/**
* @param {number[][]} matrix
* @param {number} target
* @return {boolean}
*/
var searchMatrix = function(matrix, target) {
var low = 0;
var rows = matrix.length;
var cols = matrix[0].length;
var high = rows * cols - 1;
while (low <= high) {
var mid = low + Math.floor((high - low) / 2);
var midNumber = findElementByIndex(matrix, mid, rows, cols);
if (target < midNumber) high = mid - 1;
else if (target > midNumber) low = mid + 1;
else return true;
}
return false;
};
var findElementByIndex = function(matrix, index, m, n) {
var row = Math.floor(index / n);
var col = index - n * row;
return matrix[row][col];
};
// second try
var searchMatrix = function(matrix, target) {
var low = 0;
var rows = matrix.length;
var cols = matrix[0].length;
var high = rows * cols - 1;
while (low <= high) {
var mid = low + Math.floor((high - low) / 2);
var midElement = findElementByIndex(matrix, mid, cols);
if (midElement === target) {
return true;
} else if (midElement > target) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return false;
};
// only need n (columns).
var findElementByIndex = function(matrix, index, n) {
var row = Math.floor(index / n);
var col = Math.floor(index % n);
return matrix[row][col];
};