-
Notifications
You must be signed in to change notification settings - Fork 53
/
Copy path0069. Sqrt(x).js
64 lines (58 loc) · 1.18 KB
/
0069. Sqrt(x).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
55
56
57
58
59
60
61
62
63
64
// Implement int sqrt(int x).
//
// Compute and return the square root of x, where x is guaranteed to be a non-negative integer.
//
// Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.
//
// Example 1:
//
// Input: 4
// Output: 2
//
// Example 2:
//
// Input: 8
// Output: 2
// Explanation: The square root of 8 is 2.82842..., and since
// the decimal part is truncated, 2 is returned.
/**
* @param {number} x
* @return {number}
*/
// 1) Cheating
const mySqrt1 = (x) => {
return ~~(x ** 0.5);
};
// 2)
// Time O(n)
// Space O(1)
const mySqrt2 = (x) => {
for (let i = 0; i <= x; i++) {
if (i * i === x) return i;
else if (i * i > x) return i - 1;
}
return x;
};
// 3) Integer square root
// https://en.wikipedia.org/wiki/Integer_square_root
const mySqrt3 = (x) => {
let r = x;
while (r * r > x) {
r = ((r + x / r) / 2) | 0;
}
return r;
};
// 4) Binary search
// Time O(log n)
// Space O(1)
const mySqrt = (x) => {
let l = 1;
let r = x;
while (l <= r) {
const m = ~~((l + r) / 2);
if (m * m === x) return m;
else if (m * m < x) l = m + 1;
else r = m - 1;
}
return r;
};