問題
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 つずつ開いてみましょう。
ヒント 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用に調整されています。上記の説明と制約に従ってください。