题目描述：
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 ...
归档 2018年2月16日
[LeetCode]Reaching Points
[LeetCode]Rabbits in Forest
作者是
发布于
在
LeetCode.
题目描述：
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]Minimum Distance Between BST Nodes
作者是
发布于
在
LeetCode.
题目描述：
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 ...