摘要：
Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Output: 15 Co 阅读全文
posted @ 2020-11-16 06:43
Sheanne
阅读(87)
评论(0)
推荐(0)
摘要：
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the pers 阅读全文
posted @ 2020-11-16 06:30
Sheanne
阅读(86)
评论(0)
推荐(0)
摘要：
You are given an array of distinct integers arr and an array of integer arrays pieces, where the integers in pieces are distinct. Your goal is to form 阅读全文
posted @ 2020-11-16 05:19
Sheanne
阅读(245)
评论(0)
推荐(0)
摘要：
Given the root node of a binary search tree, return the sum of values of all nodes with a value in the range [low, high]. Example 1: Input: root = [10 阅读全文
posted @ 2020-11-16 04:27
Sheanne
阅读(68)
评论(0)
推荐(0)
浙公网安备 33010602011771号