LeetCode_Gray Code

最新推荐文章于 2021-02-16 04:14:04 发布

weixin_30526593

最新推荐文章于 2021-02-16 04:14:04 发布

阅读量53

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/graph/archive/2013/06/05/3118159.html

本文介绍了一种生成灰码序列的方法，灰码是一种二进制数系统，其中任意两个连续数值只有一位不同。给出非负整数n表示二进制位数，文章提供了使用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:

00 - 0
01 - 1
11 - 3
10 - 2
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.

class Solution {
public:
    vector<int> grayCode(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        
        vector<int> result ;
        
        for(int i = 0; i< pow(2,n);i++)
        {
            int temp = (i>>1)^i;
            result.push_back(temp);
        }
        
        return result ;
        
    }
};