# 归档 2017年3月19日

## LeetCode Weekly Contest 24解题报告 作者是 在线疯狂 发布于 2017年3月19日 在 LeetCode.

LeetCode Weekly Contest 24是LeetCode举办的第二十九场正式周赛，共4道题目，比赛时长1.5小时。

LeetCode 543. Diameter of Binary Tree

LeetCode 538. Convert BST to Greater Tree

LeetCode 542. 01 Matrix

LeetCode 544. Output Contest Matches

## 题目描述：

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 ...

## 题目描述：

LeetCode 542. 01 Matrix

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 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 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 ...