2019獨(dú)角獸企業(yè)重金招聘Python工程師標(biāo)準(zhǔn)>>>

一.題目描述

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>?buildGrayCode(int?n){}int?ans(int?n){//每一位都?i?&?(i?-1)vector<int>?vec;int?x?=?1?<<?n;for(int?i=0;?i<x;?i++){vec.push_back(i?&?(i>>1));cout?<<?vec[i]?<<?'?';}return?vec;}//可以改成遞歸int?recur_ans(int?n){vector<int>?vec;if(n?<?0?)?return?vec;if(n?==?1)?{vec.push_back(0);vec.push_back(1);return?vec;}for(int?i=2;?i<n;?i++){int?highbit?=?1?<<?(i?-?1);for(int?j?=?vec.size()?-1;?j>=0;?j--){vec.push_back(highbit|j);}}return?vec;}vector<int>?recur_ans2(int?n){if(n?==0){vector<int>?vec;vec.push_back(0);return?vec;}else{vector<int>?res?=?recur_ans2(n-1);int?len?=?res.size();int?highbit?=?1?<<?(n-1);for(int?i=len-1;?i>=0;?i--){res.push_back(res[i]?|?highbit?);}return?res;}} };

轉(zhuǎn)載于:https://my.oschina.net/badboy2/blog/504097

《新程序員》：云原生和全面數(shù)字化實(shí)踐50位技術(shù)專家共同創(chuàng)作，文字、視頻、音頻交互閱讀

總結(jié)

以上是生活随笔為你收集整理的leetcode笔记：Gray Code（2016腾讯软件开发笔试题）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。