LeetCode 89 Gray Code

最新推荐文章于 2026-01-05 22:36:07 发布

原创最新推荐文章于 2026-01-05 22:36:07 发布 · 912 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #格雷码

LeetCode 同时被 2 个专栏收录

334 篇文章

订阅专栏

Leetcode Medium

244 篇文章

订阅专栏

本文介绍了一种生成格雷码序列的方法，通过简单的位运算实现序列的生成，并提供了一个Java实现示例。格雷码是一种特殊的二进制数系统，其中任意两个相邻的数值仅有一位不同。

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.

题目链接：https://leetcode.com/problems/gray-code/

题目分析：n位格雷码第i个编码的十进制为 i ^ (i >> 1)

public class Solution {
    public List<Integer> grayCode(int n) {
        List<Integer> ans = new ArrayList<>();
        for (int i = 0; i < (1 << n); i ++) {
            ans.add(i ^ (i >> 1));
        }
        return ans;
    }
}