Gray Code

来源：互联网发布：for在c语言中的作用编辑：程序博客网时间：2024/05/01 11:11

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 - 001 - 111 - 310 - 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.

wikipedia上有gray code的公式，许多人解法也都是根据公式算。看到一个python一行的code。

这个贴的是看的别人的算法，原始的是java，很巧妙。就是找规律。。。 000， 001， 011， 010， 110， 111,。放一个0，后面跟个1。然后反过来再加一位，再反过来再加，

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

0 0