leetcode之Gray Code

最新推荐文章于 2020-06-25 16:23:16 发布

fangjian1204

最新推荐文章于 2020-06-25 16:23:16 发布

阅读量1.1k

点赞数 1

分类专栏：算法 leetcode leetcode解题目录文章标签： Gray Code 格雷码 leetcode

本文链接：https://blog.csdn.net/fangjian1204/article/details/38869967

版权

算法同时被 3 个专栏收录

62 篇文章

订阅专栏

leetcode

44 篇文章

订阅专栏

leetcode解题目录

44 篇文章

订阅专栏

本文介绍了一种生成灰码序列的方法，灰码是一种特殊的二进制数系统，相邻两个数值仅有一位不同。文中给出的算法通过不断扩展已有的序列来生成指定长度的灰码序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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;
    }
};