(算法分析Week18)Gray Code[Medium]

89. Gray Code[Medium]

[题目来源https://leetcode.com/problems/gray-code/description/)

Description

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.

Solution

求n位的格雷码。
不是很清楚二进制到格雷码的转换，只知道有个镜像复制的算法，所以就写了这个。
大概流程就是 先是
0
1 然后镜像复制变成
1
0 前两位前面补0，后两位前面补充1得到
00
01
11
10 再次镜像生成3位的格雷码。

000
001
011
010

110
111
101
100
按这个规律写代码，挺简单的。每次倒着将已有的数push_back进vector里，然后与1做或运算（在前面加1，此时对应多少位1就要左移多少位）
写完后查了一下发现直接转换好像也挺简单的。

Complexity analysis

O（n²）
粗糙估计，实际小于。

Code

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int>result;
        result.push_back(0);
        for (int i = 0; i < n; i++) {
            int size = result.size();
            for (int j = size-1; j >=0; j--) {
                result.push_back(result[j] | 1 << i) ;
            }
        }

        return result;
    }
};

Result