gray code java_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.

48304ba5e6f9fe08f3fa1abda7d326ab.pngclass Solution {

public:

vector grayCode(int n) {

unsigned int data=0;

vector list;

for(int i=0;i

list.push_back(0);

for(int loc=0;loc

{

int bit=0;

int step=1<

int index=0;

while(index

{

list[index]=list[index] | (bit<

step++;

if(step==(2<

{

bit=1-bit;

step=0;

}

index++;

}

}

return list;

}

};

48304ba5e6f9fe08f3fa1abda7d326ab.png

原文:http://www.cnblogs.com/erictanghu/p/3759550.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值