【LeetCode】C# 89、Gray Code

最新推荐文章于 2018-08-05 18:02:17 发布

RUN_D

最新推荐文章于 2018-08-05 18:02:17 发布

阅读量225

点赞数

分类专栏： leetcode 文章标签： leetcode c#

本文链接：https://blog.csdn.net/qq_39643935/article/details/78258039

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

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.

题意：给定非负整数n，返回对应的所有n位二进制数。相邻的二进制数中只能有一位不同。
思路：主要是找到规律，当n=2，ans2=0，1，3，2；
当n=3，ans3=ans2[0],….,ans2[3], ans2[3]+4,ans2[2]+4,..,ans2[0]+4.
然后根据规律循环。

public class Solution {
    public IList<int> GrayCode(int n) {
        IList<int> res = new List<int>();
        res.Add(0);
        if(n==0) return res;
        res.Add(1);
        if (n == 1) return res;
        int i = 1;
        while (i++ < n)
        {
            double add = Math.Pow(2, i-1);
            for(int m = res.Count-1; m >= 0; m--)
            {
                res.Add(Convert.ToInt32(res[m] + add));
            }
        }
        return res;
    }
}