-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGray_Code.cpp
34 lines (30 loc) · 1.01 KB
/
Gray_Code.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
// 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.
class Solution {
public:
vector<int> grayCode(int n) {
vector<int> result;
result.push_back(0);
if (n == 0)
return result;
if (n == 1) {
result.push_back(1);
return result;
}
result = grayCode(n-1);
int high = 1 << (n-1); // add up the first bit
for (int i = result.size()-1; i >= 0; i--) {
result.push_back(high | result[i]);
}
return result;
}
};