首页 > 代码库 > leetcode之Gray Code
leetcode之Gray Code
Gray Code
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> res(1,0);
int i;
while(n--)
{
int highbit = res.size();//当前二进制的最高为1的位
for(i = res.size()-1;i >= 0;--i)res.push_back(highbit|res[i]);
}
return res;
}
};
leetcode之Gray Code
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。