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.

程序:

class Solution {
public:
    vector<int> grayCode(int n) {
        vector<int> res(1,0);
        if(n==0)
            return res;
        res.pop_back();

        int i=0;
        while(i<n)
        {
            if(i==0)
            {
                res.push_back(0);
                res.push_back(1);
                i++;
                continue;
            }

            for(int j=res.size()-1;j>=0;j--)
            {
                res.push_back(res[j]+(int)pow(2.0,i));
            }
            i++;
        }
        return res;
    }





};

点评:

找规律

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值