[LeetCode] 033: Gray Code

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

原创最新推荐文章于 2021-02-13 00:04:10 发布 · 3.6k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode2 专栏收录该内容

140 篇文章

订阅专栏

本文介绍了一种生成n位灰码序列的方法。灰码是一种二进制数系统，相邻两个数值只有一位不同。文中提供了一个C++类解决方案，包括获取特定位、整数转灰码及生成指定位数灰码序列的功能。

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

[Problem]

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.

[Solution]

class Solution {
public:
    // get the nthBit, index starts from 0
    int nthBit(int num, int n){
        return num & (1 << n);
    }
    // convert integer to gray
    int int2gray(int num, int n){
        for(int i = 0; i < n-1; ++i){
            int XOR = nthBit(num, i) ^ (nthBit(num, i+1)>>1);
            num = num & (~nthBit(num, i)) | XOR;
        }
	return num;
    }
    // get gray codes with n bits
    vector<int> grayCode(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> res;
        if(n < 0){
            return res;
        }
	    if(n == 0){
	        res.push_back(0);
	        return res;
	    }
	    
	    // generate
	    int m = pow(2, n);
        for(int i = 0; i < m; ++i){
            res.push_back(int2gray(i, n));
        }
        return res;
    }
};