zoukankan      html  css  js  c++  java
  • [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.

    Solution:

    参考了大神的代码

    http://fisherlei.blogspot.com/2012/12/leetcode-gray-code.html

     1 public class Solution {
     2     public List<Integer> grayCode(int n) {
     3         List<Integer> result=new ArrayList<Integer>();
     4         result.add(0);
     5         if(n<1)
     6             return result;
     7         for(int i=0;i<n;++i){
     8             int temp=1<<i;
     9             int size=result.size();
    10             for(int j=size-1;j>=0;--j){
    11                 result.add(result.get(j)+temp);
    12             }
    13         }
    14         
    15         return result;
    16     }
    17 }

    确实,如果像第一次做的时候用数学方法来做的话,interview也肯定答不出来啊

  • 相关阅读:
    第一周作业
    第八周作业
    第七周作业
    第五周作业
    第四周作业
    第三周作业
    第二周作业(markdown版本)
    第一周作业
    第六次作业
    第五周作业
  • 原文地址:https://www.cnblogs.com/Phoebe815/p/4092067.html
Copyright © 2011-2022 走看看