归档 2016年11月6日

[LeetCode]Smarking Algorithm Contest 3解题报告

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

LeetCode 452. Minimum Number of Arrows to Burst Balloons

LeetCode 446. Arithmetic Slices ...

继续阅读

[LeetCode]Arithmetic Slices II - Subsequence

题目描述:

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 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]Minimum Moves to Equal Array Elements

题目描述:

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

继续阅读

昨天

明天

归档