Leetcode 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.

---

[code]

public class Solution {
    public List<Integer> grayCode(int n) {
        List<Integer> r=new ArrayList<Integer>();
        if(n<0)return r;if(n==0){r.add(0);return r;}
        ArrayList<ArrayList<Integer>> list=helper(n);
        for(ArrayList<Integer> entry: list)
        {
            int sum=0;
            for(int i=0;i<entry.size();i++)
            {
                sum*=2;
                sum+=entry.get(i);
            }
            r.add(sum);
        }
        return r;
    }

    ArrayList<ArrayList<Integer>> helper(int n)
    {
        ArrayList<ArrayList<Integer>> r=new ArrayList<ArrayList<Integer>>();
        if(n==1)
        {
            ArrayList<Integer> zero=new ArrayList<Integer>();
            ArrayList<Integer> one =new ArrayList<Integer>();
            zero.add(0);one.add(1);
            r.add(zero);r.add(one);
            return r;
        }
        ArrayList<ArrayList<Integer>> list=helper(n-1);
        for(int i=0;i<list.size();i++)
        {
            ArrayList<Integer> li=new ArrayList<Integer>(list.get(i));
            li.add(0);
            r.add(li);
        }
        for(int i=list.size()-1;i>=0;i--)
        {
            ArrayList<Integer> li=new ArrayList<Integer>(list.get(i));
            li.add(1);
            r.add(li);
        }
        return r;
    }
}