标签归档:leetcode

RSS feed of leetcode

[LeetCode]Minimum Absolute Difference in BST

题目描述:

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解题报告

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

比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-20/

题解列表:

LeetCode 520. Detect Capital

LeetCode 526. Beautiful Arrangement

LeetCode 525. Contiguous Array

LeetCode 517. Super Washing Machines