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.
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.
gray code中文名叫格雷码,一看题就知道是模拟类型,写几个例子出来找规律。
以3位格雷码为例。
0 0 0
0 0 1
0 1 1
0 1 0
1 1 0
1 1 1
1 0 1
1 0 0
可以看到第n位的格雷码由两部分构成,一部分是n-1位格雷码,再加上 1<<(n-1)和n-1位格雷码的逆序的和。
找到规律后就好办了,轻松AC。
总结:找规律的能力太差,以至于前面完全一样的都不知道。
cai
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> vec={0};
for (int i = 1; i <= n; ++i)
{
vector<int> tmp=vec;
for (int k = vec.size()-1; k >= 0; --k)
{
tmp.push_back(vec[k]+pow(2,i-1));
}
vec=tmp;
}
return vec;
}
};