xinyu04

导航

2022年8月18日 #

[Oracle] LeetCode 333 Largest BST Subtree

摘要： Given the root of a binary tree, find the largest subtree, which is also a Binary Search Tree (BST), where the largest means subtree has the largest n 阅读全文

posted @ 2022-08-18 17:10 Blackzxy 阅读(14) 评论(0) 推荐(0) 编辑

LeetCode 295 Find Median from Data Stream

摘要： The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value and the median is the mean of the 阅读全文

posted @ 2022-08-18 02:33 Blackzxy 阅读(4) 评论(0) 推荐(0) 编辑