forked from sachuverma/DataStructures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSqrt(x).cpp
40 lines (32 loc) · 746 Bytes
/
Sqrt(x).cpp
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
/*
Sqrt(x)
======
Given a non-negative integer x, compute and return the square root of x.
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: x = 4
Output: 2
Example 2:
Input: x = 8
Output: 2
Explanation: The square root of 8 is 2.82842..., and since the decimal part is truncated, 2 is returned.
Constraints:
0 <= x <= 231 - 1
Hint #1
Try exploring all integers. (Credits: @annujoshi)
Hint #2
Use the sorted property of integers to reduced the search space. (Credits: @annujoshi)
*/
class Solution
{
public:
int mySqrt(int x)
{
if (x <= 1)
return x;
long long i = 0;
while (i * i <= x)
i++;
return --i;
}
};