FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/integer-replacement.cpp at master · pythonpeixun/LeetCode-Solutions · GitHub
pythonpeixun
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
C++
/
integer-replacement.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
55 lines (50 loc) · 1.2 KB
Breadcrumbs
LeetCode-Solutions
/
C++
/
integer-replacement.cpp
Copy path
File metadata and controls
55 lines (50 loc) · 1.2 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//
Time: O(logn)
//
Space: O(1)
//
Iterative solution.
class
Solution
{
public:
int
integerReplacement
(
int
n) {
if
(n ==
2147483647
) {
return
2
+
integerReplacement
(n /
2
+
1
);
}
int
result =
0
;
while
(n !=
1
) {
const
auto
b = n &
3
;
if
(n ==
3
) {
--n;
}
else
if
(b ==
3
) {
++n;
}
else
if
(b ==
1
) {
--n;
}
else
{
n /=
2
;
}
++result;
}
return
result;
}
};
//
Time: O(logn)
//
Space: O(logn)
//
Recursive solution
class
Solution2
{
public:
int
integerReplacement
(
int
n) {
if
(n ==
2147483647
) {
return
2
+
integerReplacement
(n /
2
+
1
);
}
if
(n <
4
) {
switch
(n %
4
) {
case
0
:
case
1
:
return
0
;
case
2
:
return
1
;
case
3
:
return
2
;
}
}
switch
(n %
4
) {
case
0
:
case
2
:
return
integerReplacement
(n /
2
) +
1
;
case
1
:
return
integerReplacement
((n -
1
) /
4
) +
3
;
case
3
:
return
integerReplacement
((n +
1
) /
4
) +
3
;
}
return
0
;
}
};
Back
|
FazBrowse Home
|
New Git URL