[LeetCode] Gray Code

[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:

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.

For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.

[Analysis]

一般的，普通二进制码与格雷码可以按以下方法互相转换：

二进制码 ->格雷码：从最右边一位起，依次将每一位与左边一位异或（XOR），作为对应格雷码该位的值，最左边一位不变（相当于左边是0）；

格雷码 -〉二进制码：从左边第二位起，将每位与左边一位解码后的值异或，作为该位解码后的值（最左边一位依然不变）。
更多讲解请参考：http://baike.baidu.com/view/358724.htm

[Solution]

class Solution {
public:
    // get the nth bit
    int nth_bit(int i){
        int bits[] = {0x0001, 0x0002, 0x0004, 0x0008, 0x0010, 0x0020, 0x0040, 0x0080, 0x0100, 0x0200, 0x0400, 0x0800};
        return bits[i];
    }
   
    // convert a integer to a gray code
    int int2gray(int num, int n){
        for(int i = 0; i < n-1; ++i){
            int XOR = (num & nth_bit(i)) ^ ((num & nth_bit(i+1)) >> 1);
            num = (num & (~nth_bit(i))) | XOR;
        }
        return num;
    }
   
    // 2^n
    int quad(int n){
        if(n == 0){
            return 1;
        }
        else{
            return 2*quad(n-1);
        }
    }
   
    // gray code
    vector<int> grayCode(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> res;
        int end = quad(n);
        for(int i = 0; i < end; ++i){
            res.push_back(int2gray(i, n));
        }
        return res;
    }
};

说明：版权所有，转载请注明出处。 Coder007的博客