leetcode -- 89. Gray Code

题目描述

题目难度:Medium
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.

• Example 1

:Input: 2
Output: [0,1,3,2]
Explanation:
00 - 0
01 - 1
11 - 3
10 - 2
For a given n, a gray code sequence may not be uniquely defined.
For example, [0,2,3,1] is also a valid gray code sequence.
00 - 0
10 - 2
11 - 3
01 - 1

• Example 2:

Input: 0
Output: [0]
Explanation:
We define the gray code sequence to begin with 0.
A gray code sequence of n has size = 2n, which for n = 0 the size is 2的零次方 = 1.
Therefore, for n = 0 the gray code sequence is [0].

AC代码

借鉴自leetcode优秀代码

class Solution {
    public List<Integer> grayCode(int n) {
        List<Integer> resList = new ArrayList<Integer>();
        resList.add(0);
        for(int i = 0;i < n;i++){
            int size = resList.size();
            for(int k = size - 1;k >= 0;k--)
                resList.add(resList.get(k) | 1 << i);
        }
        return resList;
    }
}