
BST
景行cmy
这个作者很懒,什么都没留下…
展开
-
99. Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Example 1:Input: [1,3,null,null,2] 1 /3 \ 2Output: [3,1,null,nul...原创 2019-03-26 14:33:03 · 94 阅读 · 0 评论 -
leetcode 480. Sliding Window Median
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples:[2,3,4], the median i...原创 2019-07-28 15:02:52 · 109 阅读 · 0 评论