Leetcode:Gray Code
来源:互联网 发布:广联达软件百度云 编辑:程序博客网 时间:2024/06/05 20:58
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 - 001 - 111 - 310 - 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> result; int nSize = 1 << n; for (int i = 0; i < nSize; ++i) { result.push_back((i>>1)^i); } return result; }};
0 0
- LeetCode: Gray Code
- [LeetCode] 格雷码(Gray Code)
- LeetCode Gray Code
- [Leetcode] Gray Code
- [LeetCode] Gray Code
- leetcode 112: Gray Code
- LeetCode Gray Code
- [leetCode] Gray Code
- [LeetCode]Gray Code
- Leetcode: Gray Code
- [leetcode]Gray Code
- LeetCode-Gray Code
- [leetcode] Gray Code
- LeetCode - Gray Code
- leetcode之Gray code
- LeetCode:Gray Code
- 【转载】【leetcode】Gray Code
- LeetCode - Gray Code
- Ubuntu14.04下Eclipse崩溃“crash: fatal error in soup_session_feature_detach”修复办法
- vs自动注释add-in插件编写(二)--CConnect
- Kruskal【MST】
- USACO section2.2 Runaround Numbers题解&代码
- 杭电acm 1016
- Leetcode:Gray Code
- HotSpot SA #3:FinalizerInfo
- 函数指针之探秘
- 黑马程序员--继承、抽象类、接口
- 实现C语言字符串操作的库函数
- NYOJ 题目982 Triangle Counting(数学,递推)
- A/B 题目
- 高职院校文学鉴赏教学中培养学生的主体性策略
- Leetcode[1] Two Sum (c++)