FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/gray-code.py at master · tehsints/LeetCode-Solutions · GitHub
tehsints
/
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
/
gray-code.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
27 lines (22 loc) · 658 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
gray-code.py
Copy path
File metadata and controls
27 lines (22 loc) · 658 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
# Time: O(2^n)
# Space: O(1)
class
Solution
(
object
):
def
grayCode
(
self
,
n
):
"""
:type n: int
:rtype: List[int]
"""
result
=
[
0
]
for
i
in
xrange
(
n
):
for
n
in
reversed
(
result
):
result
.
append
(
1
<<
i
|
n
)
return
result
# Proof of closed form formula could be found here:
# http://math.stackexchange.com/questions/425894/proof-of-closed-form-formula-to-convert-a-binary-number-to-its-gray-code
class
Solution2
(
object
):
def
grayCode
(
self
,
n
):
"""
:type n: int
:rtype: List[int]
"""
return
[
i
>>
1
^
i
for
i
in
xrange
(
1
<<
n
)]
Back
|
FazBrowse Home
|
New Git URL