开始刷leetcode day47：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, 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.

Java:

public class Solution {
    public ArrayList<Integer> grayCode(int n) {
        ArrayList<Integer> result = new ArrayList<Integer>();
        if(n <1) 
        {
            result.add(0);
            return result;
        }
        return calculateCode(result, n);
    }
    
    public ArrayList<Integer> calculateCode(ArrayList<Integer> result, int n)
    {
        if(n==1)
        {
            result.add(0);
            result.add(1);
            return result;
        }
        ArrayList<Integer> oldlist = calculateCode(result, n-1);
        int addnum = 1 << (n-1);
        
        for(int i=oldlist.size() -1; i>=0; i--)
        {
            result.add(addnum + result.get(i));
        }
        
        return result;
        
    }
}