Leetcode 89. Gray Code

1.题目描述

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.

2.解题思路

这个题目一开始考虑的方法是用格雷码的定义然后异或的去实现。

这是一种方法之一。

后来尝试写了几个格雷码，发现他们有递归的关系。

比如：

两位的格雷码：

00

01

11

10

最高位的话是0和1，刚好分布在前半部分和后半部分。

其余的位数刚好是对称的。

所以n位格雷码和可以在n-1位格雷码上加一个位得到。

3.实现代码

class Solution {
public:
    vector<int> grayCode(int n) {
        if(n==0){  
            vector<int> a;  
            a.push_back(0);  
            return a;  
        }  
        vector<int> last_res=grayCode(n-1);  
        vector<int> res(last_res);
        for(int i=(int)last_res.size()-1;i>=0;i--){ 
            int cur=last_res[i]+pow(2,n-1); 
            res.push_back(cur);  
        }  
        return res;  
    }
};