• LeetCode


    题目:

    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.

    思路:

    移位运算

    package math;
    
    import java.util.ArrayList;
    import java.util.List;
    
    public class GrayCode {
    
        public List<Integer> grayCode(int n) {
            List<Integer> res = new ArrayList<Integer>();
            if (n < 0) return res;
            res.add(0);
            int count = 0;
            while (count < n) {
                for (int i = res.size() - 1; i >= 0; --i) {
                    res.add(res.get(i) + (1 << count));
                }
                ++count;
            }
            return res;
        }
        
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            GrayCode g = new GrayCode();
            for (int i : g.grayCode(3))
                System.out.println(i);
        }
    
    }
  • 相关阅读:
    flash使用lua
    如何写出兼容大部分浏览器的CSS 代码
    typeof 详解
    人月神话阅读笔记(三)
    人月神话阅读笔记(二)
    仓库物资管理
    动手动脑(四)
    人月神话阅读笔记(一)
    动手动脑(六 文件操作)及课后作业
    java异常处理
  • 原文地址:https://www.cnblogs.com/null00/p/5097765.html
Copyright © 2020-2023  润新知