LeetCode Gray Code

最新推荐文章于 2025-09-11 19:19:55 发布

原创最新推荐文章于 2025-09-11 19:19:55 发布 · 451 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #C++ #算法

LeetCode 专栏收录该内容

125 篇文章

订阅专栏

本文介绍了一种生成格雷码序列的有效算法。该算法通过简单的位操作实现了从二进制码到格雷码的转换，并提供了C++实现代码。格雷码是一种特殊的二进制数系统，相邻两个数值只有一位不同。

题目

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.

即求n为数各个数对应的格雷码，

知道二进制码到格雷码的转换规则就很简单，转换步骤：

1、将二进制码右移1位

2、与原二进制码异或

代码：

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> ans;	//序列
		int len=1<<n;
		for(int i=0;i<len;i++)
			ans.push_back(i^i>>1);	//由二进制码转格雷码，错位异或
		return ans;
    }
};