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)].
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/k-th-symbol-in-grammar
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
把每个变化用树状图列出来:
0
/ \
0 1
/ \ / \
0 1 1 0
/ \ / \ / \ / \
0 1 1 0 1 0 0 1
直接看第四行,看出来,如果是第奇数个,那么他和他的父节点是一样的,如果是第偶数个,那么他和他的父节点是不同的。那么用递归就可以了。
class Solution {
public int kthGrammar(int N, int K) {
if (N == 1) {
return 0;
} else if (K % 2 == 1) {
// 奇数,和父节点一样
return kthGrammar(N - 1, (K + 1) / 2);
} else {
// 偶数,和父节点不一样
return kthGrammar(N - 1, K / 2) ^ 1;
}
}
}