FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/PuzzleCoding/src/GrayCode.java at master · wodgithub/algorithm · GitHub
wodgithub
algorithm
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
PuzzleCoding
/
src
/
GrayCode.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
99 lines (87 loc) · 2.59 KB
Breadcrumbs
algorithm
/
PuzzleCoding
/
src
/
GrayCode.java
Copy path
File metadata and controls
99 lines (87 loc) · 2.59 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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
import
java
.
util
.
Arrays
;
/**
* Created with IntelliJ IDEA.
* Print the N-bit binary reflected Gray code using recursion.
* <p/>
* Gray Code of 3:
* 000
* 001
* 011
* 010
* 110
* 111
* 101
* 100
*/
public
class
GrayCode
{
public
static
void
main
(
String
[]
args
) {
int
N
=
3
;
grayCode
(
N
,
new
boolean
[
N
]);
grayCode
(
N
);
}
public
static
void
grayCode
(
int
n
,
boolean
[]
show
) {
if
(
n
==
0
) {
showCode
(
show
);
}
else
{
show
[
n
-
1
] =
false
;
grayCode
(
n
-
1
,
show
);
show
[
n
-
1
] =
true
;
yargCode
(
n
-
1
,
show
);
}
}
// append reverse of order n gray code
public
static
void
yargCode
(
int
n
,
boolean
[]
show
) {
if
(
n
==
0
) {
showCode
(
show
);
}
else
{
show
[
n
-
1
] =
true
;
grayCode
(
n
-
1
,
show
);
show
[
n
-
1
] =
false
;
yargCode
(
n
-
1
,
show
);
}
}
public
static
void
showCode
(
boolean
[]
show
) {
String
code
=
""
;
for
(
boolean
yes
:
show
) {
if
(
yes
)
code
=
"1"
+
code
;
else
code
=
"0"
+
code
;
}
System
.
out
.
println
(
code
);
// System.out.println(Integer.parseInt(code, 2));
}
/*
** The BinaryToGray method is base on the bit of gray cod loop occur: 0,1,1,0
** Hence, we could calculate each bits of gray code by mod 4 to find the matching value
**
** However, after search on the website, the convert formula is just simply as (i>>1) ^ i.
** The ith bit is equal to ith bit plus (i+1)th bit with no carry.
*/
public
static
String
[]
grayCode
(
int
n
) {
int
[]
code
=
new
int
[
1
<<
n
];
String
[]
codeString
=
new
String
[
1
<<
n
];
for
(
int
i
=
0
;
i
< (
1
<<
n
);
i
++) {
code
[
i
] = (
i
>>
1
) ^
i
;
// codeString[i] = Integer.toBinaryString((i >> 1) ^ i);
codeString
[
i
] =
toBinaryString
((
i
>>
1
) ^
i
);
}
System
.
out
.
println
(
Arrays
.
toString
(
codeString
));
System
.
out
.
println
(
Arrays
.
toString
(
code
));
return
codeString
;
}
public
static
String
toBinaryString
(
int
integer
) {
StringBuilder
builder
=
new
StringBuilder
();
int
temp
;
while
(
integer
>=
0
) {
// 0 case
temp
=
integer
;
integer
= (
temp
>>
1
);
builder
.
append
(
String
.
valueOf
(
temp
%
2
));
// if insert at 0, no need to reverse
// builder.insert(0, String.valueOf(temp % 2));
if
(
integer
==
0
)
break
;
}
return
builder
.
reverse
().
toString
();
}
}
Back
|
FazBrowse Home
|
New Git URL