Leetcode算法学习日志-89 Gray Code

Leetcode 89 Gray Code

题目原文

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.

题意分析

给定二进制位数n，输出对应的格雷码。格雷码的没两个码字之间只有一位不同。

解法分析

格雷码有多种，3位典型格雷码如下：000-001-011-010-110-111-101-100,十进制为0,1,3,2,6,7,5,4，可以看出，三位的格雷码可以由两位格雷码得到，前一半就是两位格雷码，后一半在左边加了一个1.递归方法C++代码如下：

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> res(1,0);
        vector<int> temp;
        if(n==0)
            return res;
        temp=grayCode(n-1);
        res=temp;
        reverse(temp.begin(),temp.end());
        for(auto digit:temp){
            res.push_back((int)pow((double)2,n-1)+digit);
        }
        return res;    
    }
};

本题还有一个巧妙的方法，设格雷码第i个输出为G[i]，则G[i]=i^(i>>1)，C++代码如下：

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> result;
        
        for(int i=0;i<1<<n;i++){
            result.push_back(i^(i>>1));
        }
        return result;
    }
};

注意1<<n的含义为将1向右移动三位，相当于8.