题目描述：
LeetCode 654. Maximum Binary Tree
Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:
- The root is the maximum number in the array.
- The left subtree is the maximum tree ...
归档 2017
[LeetCode]Maximum Binary Tree
[LeetCode]Two Sum IV - Input is a BST
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 653. Two Sum IV - Input is a BST
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
Example ...
LeetCode Weekly Contest 43解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 43是LeetCode举办的第四十八场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-43/
题解列表：
[LeetCode]4 Keys Keyboard
作者是
发布于
在
LeetCode.
题目描述：
Imagine you have a special keyboard with the following keys:
Key 1: (A): Prints one 'A' on screen.
Key 2: (Ctrl-A): Select the whole screen.
Key 3: (Ctrl-C): Copy selection to buffer.
Key 4 ...
[LeetCode]Dota2 Senate
作者是
发布于
在
LeetCode.
题目描述：
In the world of Dota2, there are two parties: the Radiant and the Dire.
The Dota2 senate consists of senators coming from two parties. Now the senate wants to make a decision about a change ...