LeetCode OJ:Gray Code

最新推荐文章于 2025-08-13 21:50:19 发布

原创最新推荐文章于 2025-08-13 21:50:19 发布 · 875 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

152 篇文章

订阅专栏

本文介绍了一种生成灰码序列的高效算法。灰码是一种特殊的二进制编码系统，其中两个连续的数值仅在一个位上有所不同。文章提供了一个具体的实例，展示了如何通过简单的位操作来生成长度为2^n的灰码序列。

摘要生成于 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.

算法思想：

题目的意思其实是求0到2^n-1的格雷码

注意到格雷码是第一个数不变，然后后面的数与前一个数进行异或，其实也就是这个数与这个数右移一位的值异或

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> result;
        int len=1<<n;
        for(int i=0;i<len;i++){
            result.push_back(i^i>>1);
        }
        return result;
    }
};