*[Lintcode]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, find the sequence of gray code. A gray code sequence must begin with 0 and with cover all 2n integers.

Example

Given n = 2, return [0,1,3,2]. Its gray code sequence is:

00 - 0
01 - 1
11 - 3
10 - 2

根据格雷码定义：在一组数的编码中，若任意两个相邻的代码只有一位二进制数不同，则称这种编码为格雷码。首先数量上等于二进制码的数量，只是顺序不同。二进制码转格雷码可以使用公式Gray[i] = Gray[i-1]^B[i].

public class Solution {
    /**
     * @param n a number
     * @return Gray code
     */
    public ArrayList<Integer> grayCode(int n) {
        int size = 1 << n;
        
        ArrayList<Integer> res = new ArrayList<Integer>();
        for(int i = 0; i < size; i++) {
            int grayCode = i ^ i >> 1;
            res.add(grayCode);
        }
        return res;
    }
}