333. Largest BST Subtree

DataPipeline 發布于2019-08-16 10:35 / 2032人閱讀

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;
    }
}

云服務器 GPU云服務器 Largest Subtree BST git-subtree

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/70080.html

LeetCode[333] Largest BST Subtree

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

WrBug 2019-08-14 15:03 評論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 2019-08-16 13:37 評論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 2019-08-14 14:55 評論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 2019-08-16 13:45 評論0 收藏0
二叉排序樹

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

Soarkey 2019-08-23 14:14 評論0 收藏0