# 归档 2017年2月

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

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

LeetCode 530. Minimum Absolute Difference in BST

LeetCode 523. Continuous Subarray Sum

LeetCode 524. Longest Word in Dictionary through Deleting

LeetCode 529. Minesweeper

## 题目描述：

LeetCode 529. Minesweeper

Let's play the minesweeper game (Wikipedia, online game)!

You are given a 2D char matrix representing the game board. 'M' represents an unrevealed mine, 'E' represents an unrevealed empty square, 'B' represents a revealed blank square ...

## 题目描述：

LeetCode 524. Longest Word in Dictionary through Deleting

Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than ...

## 题目描述：

LeetCode 523. Continuous Subarray Sum

Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple ...

## 题目描述：

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