Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 89 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 89 # by problem number
lcpy gen -s gray_code # by problem name
2^n integers where:
[0, 2^n - 1],0,n, return any valid n-bit gray code sequence.
Input: n = 2
Output: [0,1,3,2]
Explanation: The binary representation of [0,1,3,2] is [00,01,11,10].
- 00 and 01 differ by one bit
- 01 and 11 differ by one bit
- 11 and 10 differ by one bit
- 10 and 00 differ by one bit
[0,2,3,1] is also a valid gray code sequence.
Input: n = 1
Output: [0,1]
1 <= n <= 16class Solution:
# Time: O(2^n)
# Space: O(1) extra space, excluding the output list
def gray_code(self, n: int) -> list[int]:
result = [0]
for i in range(n):
result.extend(value | (1 << i) for value in reversed(result))
return result
| Time | Space |
|---|---|
| O(2^n) | O(1) extra space, excluding the output list |