题目描述：
LeetCode 544. Output Contest Matches
During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, like make the rank 1 team play with the rank nth team, which is a ...
归档 2017
[LeetCode]Output Contest Matches
[LeetCode]01 Matrix
作者是
发布于
在
LeetCode.
题目描述：
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.
The distance between two adjacent cells is 1.
Example 1:
Input:
0 0 0 0 1 0 ...
[LeetCode]Convert BST to Greater Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 538. Convert BST to Greater Tree
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater ...
[LeetCode]Diameter of Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 543. Diameter of Binary Tree
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes ...
LeetCode Weekly Contest 23解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 23是LeetCode举办的第二十八场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-23/
题解列表：
LeetCode 541. Reverse String II
LeetCode 539. Minimum Time Difference