LeetCode(89)GrayCode

题目如下：

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时候的情况，会发现。n=3的结果如下:

000
001
011
010  ↑
--------
110  ↓
111
101
100

可看成是上下对称的2部分。上半部分是n=2时候的结果再在最高位加"0"的结果。下半部分是n=2时候的结果逆序之后再在最高位加"1"的结果。这样代码就很好写了。

我的代码:

using namespace std;
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);//赋值n-1时候的结果，作为本次结果的前半部分
        for(int i=(int)last_res.size()-1;i>=0;i--){ //翻折
            int cur=last_res[i]+pow(2,n-1); //最高位加1
            res.push_back(cur);
        }
        return res;
    }
};

扩展阅读:

看了matrix67大牛的文章，才发现还有更NB的东西。GreyCode其实是有数学推导公式的。可以用位运算的方法得出，非常快捷。另外这篇文章还谈到了N皇后的位运算的算法。

参考资料:

(1) http://www.matrix67.com/blog/archives/266

update: 2014-10-17 和之前思路一致，只是这次用位运算替代了乘法。

class Solution {
public:
    vector<int> grayCode(int n) {
        if (n == 0)
            return vector<int>(1, 0);
            vector<int> pre_result = grayCode(n - 1);
            vector<int> cur_result(pre_result);
            for (int i = pre_result.size() - 1; i >=0; --i) {
                cur_result.push_back((1<<(n - 1)) + pre_result[i]);
            }
            return cur_result;
    }
};