成人无码视频,亚洲精品久久久久av无码,午夜精品久久久久久毛片,亚洲 中文字幕 日韩 无码

資訊專欄INFORMATION COLUMN

333. Largest BST Subtree

DataPipeline / 2090人閱讀 

     10
    / 
   5  15
  /     
 1   8   7

return 3
public class Solution {
    public int largestBSTSubtree(TreeNode root) {
        if(root == null) return 0;
        int[] res = recursive(root);
        return res[2];
    }
    
    public int[] recursive(TreeNode root){
        int[] res = new int[5];
        // res[0] BST or Not?
        // res[1] total number nodes of subtree
        // res[2] max number of BST subtree 
        // res[3] min
        // res[4] max
        res[0] = 1; res[3] = Integer.MAX_VALUE; res[4] = Integer.MIN_VALUE;
        if(root == null) return res;
        
        int[] resL = recursive(root.left);
        int[] resR = recursive(root.right);
        if(resL[0] == 0 || resR[0] == 0 || resL[4] >= root.val || resR[3] <= root.val) 
            res[0] = 0;
        res[1] = resL[1] + resR[1] + 1;
        res[2] = (res[0] == 1) ? res[1]: Math.max(resL[2], resR[2]);
        res[3] = root.val < resL[3] ? root.val : resL[3];
        res[4] = root.val > resR[4] ? root.val : resR[4];
        return res;
    }
}

文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請注明本文地址：http://m.hztianpu.com/yun/70080.html

相關(guān)文章

  • LeetCode[333] Largest BST Subtree

    摘要：復(fù)雜度思路考慮對于每一個節(jié)點來說，能組成的的。那么并且所以我們需要兩個返回值，一個是這個是不是，另一個是當前的能組成的最大的值。代碼這個能構(gòu)成一個這個不能構(gòu)成一個 LeetCode[333] Largest BST Subtree Given a binary tree, find the largest subtree which is a Binary SearchTree (B...

    WrBug 評論0 收藏0

  • [LeetCode] 333. Largest BST Subtree

    Problem Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. Note:A subtree must include all of its descen...

    tigerZH 評論0 收藏0

  • [LeetCode] Largest BST Subtree

    Largest BST Subtree Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. Note: A subtree must include all ...

    Youngdze 評論0 收藏0

  • [LeetCode] 776. Split BST

    Problem Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes that are all smaller or equal to the target value, whil...

    baiy 評論0 收藏0

  • 二叉排序樹

    摘要：節(jié)點的構(gòu)造函數(shù)默認為其初始化都是。二叉排序樹插入插入節(jié)點只要遵循一個原則就好大與就向中插入，小于就向插入。初始化數(shù)據(jù)樹現(xiàn)在來試試實例化一個來看看效果。 JavaScript 數(shù)據(jù)結(jié)構(gòu)篇 之 BST 前言 有段時間沒有寫文章了，整個人感覺變得有點懶散了，大家可不要向我一樣哦~今天開始 seaconch 打算開始記錄 JavaScript 數(shù)據(jù)結(jié)構(gòu)的學(xué)習(xí)經(jīng)歷。至此，開始。 課本：《學(xué)習(xí)J...

    Soarkey 評論0 收藏0

發(fā)表評論

0條評論

閱讀需要支付1元查看
<