zoukankan      html  css  js  c++  java
  • leetcode 30 days challenge Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree

    Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree

    Given a binary tree where each path going from the root to any leaf form a valid sequence, check if a given string is a valid sequence in such binary tree.

    We get the given string from the concatenation of an array of integers arr and the concatenation of all values of the nodes along a path results in a sequence in the given binary tree.

    Example 1:
    img

    Input: root = [0,1,0,0,1,0,null,null,1,0,0], arr = [0,1,0,1]
    Output: true
    Explanation:
    The path 0 -> 1 -> 0 -> 1 is a valid sequence (green color in the figure).
    Other valid sequences are:
    0 -> 1 -> 1 -> 0
    0 -> 0 -> 0
    Example 2:
    img

    Input: root = [0,1,0,0,1,0,null,null,1,0,0], arr = [0,0,1]
    Output: false
    Explanation: The path 0 -> 0 -> 1 does not exist, therefore it is not even a sequence.
    Example 3:
    img

    Input: root = [0,1,0,0,1,0,null,null,1,0,0], arr = [0,1,1]
    Output: false
    Explanation: The path 0 -> 1 -> 1 is a sequence, but it is not a valid sequence.

    Constraints:

    1 <= arr.length <= 5000
    0 <= arr[i] <= 9
    Each node's value is between [0 - 9].

    solution

    Depth-first search (DFS) with the parameters: current node in the binary tree and current position in the array of integers.深度优先遍历

    When reaching at final position check if it is a leaf node.

    class Solution {
    public:
        bool isValidSequence(TreeNode* root, vector<int>& arr) {
            return helper(root,arr,0);
        }
        bool helper(TreeNode * node,vector<int>& arr, int pos)
        {
            if(node==NULL)
                return false;
            if(node->val!=arr[pos])
               return false;
    
            if(pos==arr.size()-1)//数组完了,判断当前节点是不是叶节点
                return (node->left==NULL && node->right==NULL);
    
            return(helper(node->left,arr,pos+1)||helper(node->right,arr,pos+1));
        }
    };
    

    参考链接

    leetCode

    blogs record our growth
  • 相关阅读:
    Java四种引用类型+ReferenceQueue+WeakHashMap
    浅谈怎样写好一篇(技术)博客?
    MySQL-5.7.14-WinX64安装配置详解
    网络编程梳理:Android网络基础知识复习
    Git时间:常用Git命令收集整理(持续更新)
    一些常见技术问题收集(二)持续更新
    开源库AndroidSwipeLayout分析(一),炫酷ItemView滑动呼出效果
    开源库AndroidSwipeLayout分析(二),SwipeLayout源码探究
    ES 基础操作
    pymongo
  • 原文地址:https://www.cnblogs.com/qwfand/p/12810961.html
Copyright © 2011-2022 走看看