FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/integer-replacement.py 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
/
Python
/
integer-replacement.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
44 lines (38 loc) · 932 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
integer-replacement.py
Copy path
File metadata and controls
44 lines (38 loc) · 932 Bytes
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
# Time: O(logn)
# Space: O(1)
class
Solution
(
object
):
def
integerReplacement
(
self
,
n
):
"""
:type n: int
:rtype: int
"""
result
=
0
while
n
!=
1
:
b
=
n
&
3
if
n
==
3
:
n
-=
1
elif
b
==
3
:
n
+=
1
elif
b
==
1
:
n
-=
1
else
:
n
/=
2
result
+=
1
return
result
# Time: O(logn)
# Space: O(logn)
# Recursive solution.
class
Solution2
(
object
):
def
integerReplacement
(
self
,
n
):
"""
:type n: int
:rtype: int
"""
if
n
<
4
:
return
[
0
,
0
,
1
,
2
][
n
]
if
n
%
4
in
(
0
,
2
):
return
self
.
integerReplacement
(
n
/
2
)
+
1
elif
n
%
4
==
1
:
return
self
.
integerReplacement
((
n
-
1
)
/
4
)
+
3
else
:
return
self
.
integerReplacement
((
n
+
1
)
/
4
)
+
3
Back
|
FazBrowse Home
|
New Git URL