Smarking Algorithm Contest 3是LeetCode举办的第十一场正式周赛，共4道题目，比赛时长2.5小时。
比赛链接：https://leetcode.com/contest/smarking-algorithm-contest-3
题解列表：
LeetCode 453. Minimum Moves to Equal Array Elements
LeetCode 447. Number of Boomerangs
归档 2016年11月6日
[LeetCode]Smarking Algorithm Contest 3解题报告
[LeetCode]Arithmetic Slices II - Subsequence
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 446. Arithmetic Slices II - Subsequence
A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
For example, these are arithmetic sequences ...
[LeetCode]Minimum Number of Arrows to Burst Balloons
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 452. Minimum Number of Arrows to Burst Balloons
There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates ...
[LeetCode]Number of Boomerangs
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 447. Number of Boomerangs
Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i ...
[LeetCode]Minimum Moves to Equal Array Elements
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 453. Minimum Moves to Equal Array Elements
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1 ...