destroy-sequential-targets

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed array <code>nums</code> consisting of positive integers, representing targets on a number line. You are also given an integer <code>space</code>.

You have a machine which can destroy targets. Seeding the machine with some <code>nums[i]</code> allows it to destroy all targets with values that can be represented as <code>nums[i] + c * space</code>, where <code>c</code> is any non-negative integer. You want to destroy the maximum number of targets in <code>nums</code>.

Return the minimum value of <code>nums[i]</code> you can seed the machine with to destroy the maximum number of targets.

&nbsp;
Example 1:

<pre>
Input: nums = [3,7,8,1,1,5], space = 2
Output: 1
Explanation: If we seed the machine with nums[3], then we destroy all targets equal to 1,3,5,7,9,... 
In this case, we would destroy 5 total targets (all except for nums[2]). 
It is impossible to destroy more than 5 targets, so we return nums[3].
</pre>

Example 2:

<pre>
Input: nums = [1,3,5,2,4,6], space = 2
Output: 1
Explanation: Seeding the machine with nums[0], or nums[3] destroys 3 targets. 
It is not possible to destroy more than 3 targets.
Since nums[0] is the minimal integer that can destroy 3 targets, we return 1.
</pre>

Example 3:

<pre>
Input: nums = [6,2,5], space = 100
Output: 2
Explanation: Whatever initial seed we select, we can only destroy 1 target. The minimal seed is nums[1].
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>1 &lt;= space &lt;=&nbsp;109</code></li>
</ul>

destroyTargets

Destroy Sequential Targets

Arithmetic Slices II - Subsequence

arithmetic-slices-ii-subsequence

等差数列划分 II - 子序列

Pairs of Songs With Total Durations Divisible by 60

pairs-of-songs-with-total-durations-divisible-by-60

总持续时间可被 60 整除的歌曲

Longest Arithmetic Subsequence

longest-arithmetic-subsequence

最长等差数列

Longest Arithmetic Subsequence of Given Difference

longest-arithmetic-subsequence-of-given-difference

最长定差子序列

Array

Hash Table

Counting

给你一个下标从 0&nbsp;开始的数组&nbsp;<code>nums</code>&nbsp;，它包含若干正整数，表示数轴上你需要摧毁的目标所在的位置。同时给你一个整数&nbsp;<code>space</code>&nbsp;。

你有一台机器可以摧毁目标。给机器 输入&nbsp;<code>nums[i]</code>&nbsp;，这台机器会摧毁所有位置在&nbsp;<code>nums[i] + c * space</code>&nbsp;的目标，其中&nbsp;<code>c</code>&nbsp;是任意非负整数。你想摧毁&nbsp;<code>nums</code>&nbsp;中 尽可能多&nbsp;的目标。

请你返回在摧毁数目最多的前提下，<code>nums[i]</code>&nbsp;的 最小值&nbsp;。

&nbsp;

示例 1：

<pre>输入：nums = [3,7,8,1,1,5], space = 2
输出：1
解释：如果我们输入 nums[3] ，我们可以摧毁位于 1,3,5,7,9,... 这些位置的目标。
这种情况下， 我们总共可以摧毁 5 个目标（除了 nums[2]）。
没有办法摧毁多于 5 个目标，所以我们返回 nums[3] 。
</pre>

示例 2：

<pre>输入：nums = [1,3,5,2,4,6], space = 2
输出：1
解释：输入 nums[0] 或者 nums[3] 都会摧毁 3 个目标。
没有办法摧毁多于 3 个目标。
由于 nums[0] 是最小的可以摧毁 3 个目标的整数，所以我们返回 1 。
</pre>

示例 3：

<pre>输入：nums = [6,2,5], space = 100
输出：2
解释：无论我们输入哪个数字，都只能摧毁 1 个目标。输入的最小整数是 nums[1] 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>1 &lt;= space &lt;=&nbsp;109</code></li>
</ul>