Gray Code LeetCode solution in Java

1
class Solution {
2
  public List<Integer> grayCode(int n) {
3
    ArrayList list = new ArrayList();
4
    for (int i = 0; i < (1 << n); i++) {
5
      list.add(i ^ (i >> 1));
6
    }
7
    return list;
8
  }
9
}