题目描述:
LeetCode 457. Circular Array Loop
You are given an array of positive and negative integers. If a number n at an index is positive, then move forward n steps. Conversely, if it's negative (-n), move backward n steps. Assume ...
LeetCode 457. Circular Array Loop
You are given an array of positive and negative integers. If a number n at an index is positive, then move forward n steps. Conversely, if it's negative (-n), move backward n steps. Assume ...
There are 1000 buckets, one and only one of them contains poison, the rest are filled with water. They all look the same. If a pig drinks that poison it will die within 15 minutes ...
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 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 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 ...