第i个格雷码的数学解是:(i >> 1) ^ i
代码:
class Solution
{
public:
vector<int> grayCode(int n)
{
vector<int> ret;
for (int i=0, num=1<<n; i < num; ++ i)
{
ret.push_back( (i>>1)^i );
}
return ret;
}
};
第i个格雷码的数学解是:(i >> 1) ^ i
代码:
class Solution
{
public:
vector<int> grayCode(int n)
{
vector<int> ret;
for (int i=0, num=1<<n; i < num; ++ i)
{
ret.push_back( (i>>1)^i );
}
return ret;
}
};