类别归档：LeetCode

LeetCode OJ is a platform for preparing technical coding interviews.

题目描述：

LeetCode 530. Minimum Absolute Difference in BST

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example:

```Input:

1
\
3
/
2

Output:
1

Explanation:
The minimum absolute difference is ...```

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

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

LeetCode 520. Detect Capital

LeetCode 526. Beautiful Arrangement

LeetCode 525. Contiguous Array

LeetCode 517. Super Washing Machines

题目描述：

LeetCode 517. Super Washing Machines

You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.

For each move, you could choose any m (1 ≤ m ≤ n) washing machines ...

题目描述：

LeetCode 525. Contiguous Array

Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.

Example 1:
Input: [0,1]
Output: 2
Explanation: [0, 1] is the longest contiguous subarray with ...

[LeetCode]Beautiful Arrangement 作者是 在线疯狂 发布于 2017年2月19日 在 LeetCode.

LeetCode 526. Beautiful Arrangement

Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the i ...