class Solution {
// 滑动窗口
public int findLHS(int[] nums) {
Arrays.sort(nums);
int left = 0, res = 0;
for(int right = 0; right < nums.length; right++){
while(nums[right] - nums[left] > 1){
++left;
}
if(nums[right] - nums[left] == 1){
res = Math.max(res, right - left + 1);
}
}
return res;
}
}
594.最长和谐子序列。滑动窗口0ms
最新推荐文章于 2024-10-05 12:29:44 发布