[LeetCode] Gray Code

最新推荐文章于 2019-05-22 11:17:35 发布

原创最新推荐文章于 2019-05-22 11:17:35 发布 · 361 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #C++

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一种生成格雷码序列的方法，格雷码是一种二进制数系统，其中两个连续的数值仅在一个位上不同。文章提供了一个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.

格雷码

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> res(1, 0);
        for (int i=0; i<n; i++)
        {
            int current_size = res.size();
            while (current_size)
            {
                current_size--;
                res.push_back(res[current_size] + (1 << i));
            }
        }
        return res;
    }
};