Leetcode 88：Gray Code

最新推荐文章于 2021-02-13 00:04:10 发布

被打的小怪兽

最新推荐文章于 2021-02-13 00:04:10 发布

阅读量110

点赞数

CC 4.0 BY-SA版权

分类专栏：算法题

本文链接：https://blog.youkuaiyun.com/qq_34314736/article/details/99690954

算法题专栏收录该内容

118 篇文章

订阅专栏

本文介绍了一种生成格雷码序列的方法，格雷码是一种二进制数系统，其中两个连续的值仅在一个位上不同。文章提供了一个C++函数，用于给定位数n时生成格雷码序列，序列必须从0开始。通过示例展示了输入2时的格雷码序列，并解释了对于给定的n，格雷码序列可能不是唯一的。

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

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.

Example 1:

Input: 2
Output: [0,1,3,2]
Explanation:
00 - 0
01 - 1
11 - 3
10 - 2

For a given n, a gray code sequence may not be uniquely defined.
For example, [0,2,3,1] is also a valid gray code sequence.

00 - 0
10 - 2
11 - 3
01 - 1
Example 2:

Input: 0
Output: [0]
Explanation: We define the gray code sequence to begin with 0.
A gray code sequence of n has size = 2n, which for n = 0 the size is 20 = 1.
Therefore, for n = 0 the gray code sequence is [0].

C++
vector<int> grayCode(int n) {
        vector<int> res;
        for(int i = 0;i < pow(2,n);++i)
        {
             res.push_back((i>>1)^i);
        }
        return res;
    }