## 题目描述：

LeetCode 780. Reaching Points

A move consists of taking a point `(x, y)` and transforming it to either `(x, x+y)` or `(x+y, y)`.

Given a starting point `(sx, sy)` and a target point `(tx, ty)`, return `True ...`

## 题目描述：

LeetCode 781. Rabbits in Forest

In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them. Those `answers` are placed in an ...

## 题目描述：

LeetCode 783. Minimum Distance Between BST Nodes

Given a Binary Search Tree (BST) with the root node `root`, return the minimum difference between the values of any two different nodes in the tree.

Example :

`Input: root = [4,2,6,1 ...`

## LeetCode Weekly Contest 70解题报告 作者是 在线疯狂 发布于 2018年2月4日 在 LeetCode.

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

LeetCode 779. K-th Symbol in Grammar

LeetCode 776. Split BST

LeetCode 777. Swap Adjacent in LR String

LeetCode 778. Swim in Rising Water

## 题目描述：

LeetCode 778. Swim in Rising Water

On an N x N `grid`, each square `grid[i][j]` represents the elevation at that point `(i,j)`.

Now rain starts to fall. At time `t`, the depth of the water everywhere ...