89. Gray Code

最新推荐文章于 2022-02-10 23:00:06 发布

原创最新推荐文章于 2022-02-10 23:00:06 发布 · 405 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Backtracking #Gray Code

LeetCode 同时被 2 个专栏收录

402 篇文章

订阅专栏

Backtracking

26 篇文章

订阅专栏

本文介绍了一种使用迭代方法生成灰码序列的算法。灰码是一种特殊的二进制数表示方式，相邻两个数值仅有一位不同。文章提供了一个具体的实现示例，通过在数字前逐次增加1来生成指定位数的灰码序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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.

这道题可以用迭代的方法在数字之前加1，每次从list的最后一位向前迭代。代码如下：

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