문제
In a Gray code sequence each value differs from the previous one in exactly one bit. The standard (reflected binary) Gray code of i is i XOR (i >> 1): for 2 bits the sequence is 0, 1, 3, 2, which is 00, 01, 11, 10 in binary. Rotary encoders use it so that a reading taken between two positions is never wildly wrong.
Implement gray_code(n).
Input
n: The number of bits.
Output
Return the 2^n values of the reflected binary Gray code in order, as integers, starting with 0. For n = 0 return [0].
제약 조건
0 ≤ n ≤ 16
예시
입력:
n = 2
예상 출력:
expected = [0, 1, 3, 2]
입력:
long long n = 2;
예상 출력:
std::vector<long long> expected = {0, 1, 3, 2};
입력:
long n = 2;
예상 출력:
long[] expected = new long[] {0, 1, 3, 2};
설명
In binary the sequence is 00, 01, 11, 10, so the answer is [0, 1, 3, 2].
입력:
n = 3
예상 출력:
expected = [0, 1, 3, 2, 6, 7, 5, 4]
입력:
long long n = 3;
예상 출력:
std::vector<long long> expected = {0, 1, 3, 2, 6, 7, 5, 4};
입력:
long n = 3;
예상 출력:
long[] expected = new long[] {0, 1, 3, 2, 6, 7, 5, 4};
설명
Each value is i XOR (i >> 1) for i = 0 to 7: [0, 1, 3, 2, 6, 7, 5, 4].
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Loop i from 0 to 2^n − 1.
힌트 2
Each Gray code value comes from i and i shifted right by one.
힌트 3
For n = 0 the loop runs once and gives [0].
예상 복잡도
O(2^n) time, O(2^n) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.