On the first row, we write a 0. Now in every subsequent row, we look at the previous row and replace each occurrence of 0 with 01, and each occurrence of 1 with 10.
Given row N and index K, return the K-th indexed symbol in row N. (The values of K are 1-indexed.) (1 indexed).
Examples:
Input: N = 1, K = 1
Output: 0
Input: N = 2, K = 1
Output: 0
Input: N = 2, K = 2
Output: 1
Input: N = 4, K = 5
Output: 1
Explanation:
row 1: 0
row 2: 01
row 3: 0110
row 4: 01101001
Note:
N will be an integer in the range [1, 30].
K will be an integer in the range [1, 2^(N-1)].
思路:
结果跟行数 N 无关,因为每一行都是由上一行在末尾加上数字得到的。而我们要注意的是 K,第K个数是由上一行的第 ⌈K/2⌉ 个数算出来的。(比如第7个数是由第4个数算出来的,且数字等于第4个数。 第8个数是由第4个数算出来的,且数字与第4个数相反)。因此得到递归解法。
class Solution {
public int kthGrammar(int N, int K) {
if(K==1){
return 0;
}
if(K==2){
return 1;
}
if(K%2==1){
return kthGrammar(-1, (K+1)/2);
} else {
return 1-kthGrammar(-1, K/2);
}
}
}