题目:
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.
For example, given n = 2, return [0,1,3,2]
. Its gray code sequence is:
00 - 0 01 - 1 11 - 3 10 - 2
Note:
For a given n, a gray code sequence is not uniquely defined.
For example, [0,2,3,1]
is also a valid gray code sequence according to the above definition.
For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.
解法:
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> result;
result.push_back(0);
if(n == 0) {
return result;
}
result.push_back(1);
if(n == 1) {
return result;
}
//pow_2既可以表示当前result中元素个数,又可以作为后续加入result中元素的增量
int pow_2 = 1;
for(int i = 2; i <= n; i++) {
pow_2 *= 2;
for(int j = pow_2 - 1; j >=0; j--) {
result.push_back(result[j] + pow_2);
}
}
return result;
}
};
思路:我把这道题目当成了动态规划,bit-num为1时,毫无疑问结果是[0,1],接下来bit每增加1时,vector的size增加一倍,切vector原有元素不变,后一半多出来的元素为前一半元素倒序加上2的(bit-num-1)次方。
用二进制来解释,比如bit-num为2时,vector为[00,01,11,10],bit-num变为3后,原vector不变,然后倒序在元素前加1,即变为[000,001,011,010,110,111,101,100]