Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
55 lines (49 loc) · 1.36 KB

File metadata and controls

55 lines (49 loc) · 1.36 KB
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
package problems;
public class LeetCode1545 {
public char findKthBit(int n, int k) {
String str = "0";
// String str = "";
for (int i = 2; i <= n; i++) {
str = str + "1" + reverse(invert(str));
}
return str.charAt(k-1);
}
private String invert(String str){
StringBuilder builder = new StringBuilder();
for (int i = 0; i < str.length(); i++) {
if(str.charAt(i) == '0'){
builder.append('1');
}else{
builder.append('0');
}
}
return builder.toString();
}
private String reverse(String str){
StringBuilder builder = new StringBuilder(str);
return builder.reverse().toString();
}
public static void main(String[] args) {
LeetCode1545 leetCode1545 = new LeetCode1545();
leetCode1545.findKthBit(4, 11);
}
}
class LeetCode1545_1{
public char findKthBit(int n, int k) {
if (k == 1) {
return '0';
}
int mid = 1 << (n - 1);
if (k == mid) {
return '1';
} else if (k < mid) {
return findKthBit(n - 1, k);
} else {
k = mid * 2 - k;
return invert(findKthBit(n - 1, k));
}
}
public char invert(char bit) {
return (char) ('0' + '1' - bit);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.