给你一个整数数组 arr
和一个整数 difference
,请你找出并返回 arr
中最长等差子序列的长度,该子序列中相邻元素之间的差等于 difference
。
子序列 是指在不改变其余元素顺序的情况下,通过删除一些元素或不删除任何元素而从 arr
派生出来的序列。
示例 1:
输入:arr = [1,2,3,4], difference = 1 输出:4 解释:最长的等差子序列是 [1,2,3,4]。
示例 2:
输入:arr = [1,3,5,7], difference = 1 输出:1 解释:最长的等差子序列是任意单个元素。
示例 3:
输入:arr = [1,5,7,8,5,3,4,2,1], difference = -2 输出:4 解释:最长的等差子序列是 [7,5,3,1]。
提示:
1 <= arr.length <= 105
-104 <= arr[i], difference <= 104
package Solution1218;
import java.util.Arrays;
class Solution5 {
public int longestSubsequence(int[] arr, int difference) {
int maxlen = 1;
if (arr.length < 2) {
return arr.length;
}
// Arrays.sort(arr);
// System.out.println(Arrays.toString(arr));
int count = 1;
int temp = 0;
for (int i = 0; i < arr.length; i++) {
temp = arr[i];
count = 1;
for (int j = i + 1; j < arr.length; j++) {
if (arr[j] == temp + difference) {
// System.out.println(arr[i]);
count++;
temp = arr[j];
} else {
continue;
}
if (count > maxlen) {
maxlen = count;
}
}
}
return maxlen;
}
public static void main(String[] args) {
Solution5 sol = new Solution5();
int[] arr = { 4, 12, 10, 0, -2, 7, -8, 9, -9, -12, -12, 8, 8 };
int difference = 0;
System.out.println(sol.longestSubsequence(arr, difference));
}
}
超时