zoukankan      html  css  js  c++  java
  • K-th Symbol in Grammar

    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



    The whole structure can be viewed a binary tree, when a node is 0, their two children nodes are 0 and 1,
    similarly, when a node is 1, two children nodes are 1 and 0.
    We can know whether the position of K is a left node or a right node by dividing 2.
    If K is even, current node is right child, and its parent is the (K/2)th node in previous row;
    else if K is odd, current node is left child and its parent is the ((K+1)/2)th node in previous row.
    The value of current node depends on its parent node, without knowing its parent node value,
    we still cannot determine current node value.
    That's why we need recursion, we keep going previous row to find the parent node until reach the first row.
    Then all the parent node value will be determined after the recursion function returns.

    class Solution {
    public:
        int kthGrammar(int N, int K) {
        if (N == 1) return 0;
        if (K % 2 == 0) return (kthGrammar(N - 1, K / 2) == 0) ? 1 : 0;
        else return (kthGrammar(N - 1, (K + 1) / 2) == 0) ? 0 : 1;
        }
    };
    
    
    
     
  • 相关阅读:
    composer npm bower 版本依赖符号说明
    FastAdmin 速极后台框架从 v1.0 到 v1.2 的数据库升级
    FastAdmin 也可以出书了
    FastAdmin 开发时用到的 Git 命令 (2020-09-26)
    FastAdmin用什么弹窗组件
    笔记:Linux 文件权限
    笔记:使用源代码在 Centos 7 安装 Git 2
    php gd 生成表格 图片
    easyui datagrid 清空
    mysql 去重
  • 原文地址:https://www.cnblogs.com/250101249-sxy/p/11494395.html
Copyright © 2011-2022 走看看