-
Notifications
You must be signed in to change notification settings - Fork 0
/
power of two.txt
109 lines (73 loc) · 1.46 KB
/
power of two.txt
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
Given an integer n, return true if it is a power of two. Otherwise, return false.
An integer n is a power of two, if there exists an integer x such that n == 2x.
Example 1:
Input: n = 1
Output: true
Explanation: 20 = 1
Example 2:
Input: n = 16
Output: true
Explanation: 24 = 16
Example 3:
Input: n = 3
Output: false
Example 4:
Input: n = 4
Output: true
Example 5:
Input: n = 5
Output: false
Constraints:
-231 <= n <= 231 - 1
solution:
class Solution {
public:
bool isPowerOfTwo(int n)
{
if(n < 0)
return false;
int cnt = 0;
while(n)
{
cnt++;
n = n & (n-1);
}
if(cnt == 1)
return true;
else
return false;
}
};
Solution
class Solution {
public:
bool isPowerOfTwo(int n) {
for(int i = 0 ; i <= 30 ; i++)
{
int ans = pow(2,i);
if(ans == n)
{
return true;
}
}
return false;
}
};
class Solution {
public:
bool isPowerOfTwo(int n) {
int ans = 1;
for(int i = 0 ; i <= 30 ; i++)
{
if(ans == n)
{
return true;
}
if(ans < INT_MAX/2)
{
ans = ans * 2;
}
}
return false;
}
};