Class Solution
- java.lang.Object
-
- g1501_1600.s1545_find_kth_bit_in_nth_binary_string.Solution
-
public class Solution extends Object
1545 - Find Kth Bit in Nth Binary String.Medium
Given two positive integers
nandk, the binary stringSnis formed as follows:S1 = “0”Si = Si - 1 + “1” + reverse(invert(Si - 1))fori > 1
Where
+denotes the concatenation operation,reverse(x)returns the reversed stringx, andinvert(x)inverts all the bits inx(0changes to1and1changes to0).For example, the first four strings in the above sequence are:
S1 = “0”S2 = “011”S3 = “0111001”S4 = “011100110110001”
Return the
kthbit inSn. It is guaranteed thatkis valid for the givenn.Example 1:
Input: n = 3, k = 1
Output: “0”
Explanation: S3 is “0111001”. The 1st bit is “0”.
Example 2:
Input: n = 4, k = 11
Output: “1”
Explanation: S4 is “011100110110001”. The 11th bit is “1”.
Constraints:
1 <= n <= 201 <= k <= 2n - 1
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description charfindKthBit(int n, int k)
-