-
Notifications
You must be signed in to change notification settings - Fork 21
/
GrayCode.go
41 lines (34 loc) · 1.08 KB
/
GrayCode.go
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
35
36
37
38
39
40
41
package GrayCode
import "math"
//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.
//
//Accepted.
func grayCode(n int) []int {
resultList := make([]int, 0)
if n <= 0 {
resultList = append(resultList, 0)
return resultList
}
if n == 1 {
resultList = append(resultList, 0)
resultList = append(resultList, 1)
return resultList
}
resultList = grayCode(n - 1)
for i := len(resultList) - 1; i >= 0; i-- {
resultList = append(resultList, resultList[i]+int(math.Pow(2, float64(n-1))))
}
return resultList
}