FilesExpand file tree

 master

/

GrayCode.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

43 lines (39 loc) · 1.23 KB

 master

/

GrayCode.java

Top

File metadata and controls

• Code
• Blame

43 lines (39 loc) · 1.23 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

42

43

package bit_manipulation;

import java.util.ArrayList;

import java.util.List;

/**

* Created by gouthamvidyapradhan on 16/03/2017.

* The gray code is a binary numeral system where two successive values differ in only one bit.

* <p>

* 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.

* <p>

* For example, given n = 2, return [0,1,3,2]. Its gray code sequence is:

* <p>

* 00 - 0

* 01 - 1

* 11 - 3

* 10 - 2

* Note:

* For a given n, a gray code sequence is not uniquely defined.

* <p>

* For example, [0,2,3,1] is also a valid gray code sequence according to the above definition.

* <p>

* For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.

*/

public class GrayCode {

/**

* Main method

*

* @param args

* @throws Exception

*/

public static void main(String[] args) throws Exception {

List<Integer> result = new GrayCode().grayCode(3);

}

public List<Integer> grayCode(int n) {

List<Integer> result = new ArrayList<>();

for (int i = 0; i <= ((1 << n) - 1); i++)

result.add(i ^ (i >> 1));

return result;

}

}