find-the-maximum-length-of-valid-subsequence-ii

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> and a positive integer <code>k</code>.
A subsequence <code>sub</code> of <code>nums</code> with length <code>x</code> is called valid if it satisfies:

<ul>
	<li><code>(sub[0] + sub[1]) % k == (sub[1] + sub[2]) % k == ... == (sub[x - 2] + sub[x - 1]) % k.</code></li>
</ul>
Return the length of the longest valid subsequence of <code>nums</code>.
&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3,4,5], k = 2

Output: 5

Explanation:

The longest valid subsequence is <code>[1, 2, 3, 4, 5]</code>.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,4,2,3,1,4], k = 3

Output: 4

Explanation:

The longest valid subsequence is <code>[1, 4, 1, 4]</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 103</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 107</code></li>
	<li><code>1 &lt;= k &lt;= 103</code></li>
</ul>

第 404 场周赛

weekly-contest-404

maximumLength

资深工程师

Find the Maximum Length of Valid Subsequence II

Longest Increasing Subsequence

longest-increasing-subsequence

最长递增子序列

Length of the Longest Subsequence That Sums to Target

length-of-the-longest-subsequence-that-sums-to-target

和为目标值的最长子序列的长度

Array

Dynamic Programming

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个 正&nbsp;整数&nbsp;<code>k</code>&nbsp;。
<code>nums</code>&nbsp;的一个&nbsp;子序列 <code>sub</code>&nbsp;的长度为 <code>x</code>&nbsp;，如果其满足以下条件，则称其为 有效子序列&nbsp;：

<ul>
	<li><code>(sub[0] + sub[1]) % k == (sub[1] + sub[2]) % k == ... == (sub[x - 2] + sub[x - 1]) % k</code></li>
</ul>
返回 <code>nums</code>&nbsp;的 最长有效子序列&nbsp;的长度。

&nbsp;

示例 1：

<div class="example-block">
输入：nums = [1,2,3,4,5], k = 2

输出：5

解释：

最长有效子序列是&nbsp;<code>[1, 2, 3, 4, 5]</code>&nbsp;。
</div>

示例 2：

<div class="example-block">
输入：nums = [1,4,2,3,1,4], k = 3

输出：4

解释：

最长有效子序列是&nbsp;<code>[1, 4, 1, 4]</code>&nbsp;。
</div>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= nums.length &lt;= 103</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 107</code></li>
	<li><code>1 &lt;= k &lt;= 103</code></li>
</ul>