摘要：
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文
posted @ 2020-01-15 22:20
xuan_abc
阅读(98)
评论(0)
推荐(0)
摘要：
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up 阅读全文
posted @ 2020-01-15 12:22
xuan_abc
阅读(108)
评论(0)
推荐(0)
摘要：
Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + 阅读全文
posted @ 2020-01-15 11:44
xuan_abc
阅读(181)
评论(0)
推荐(0)
浙公网安备 33010602011771号