leetcode 594. Longest Harmonious Subsequence

题目

https://leetcode-cn.com/problems/longest-harmonious-subsequence/

题解

我的解法

测试用例

[1]
[1,2]
[2,1]
[3,1]
[3,1,1]
[3,5,5]
[1,3,5,7]
[2,2]
[1,2,1,2,1,2,1,2,1,2]
[3,3,3,2,2,2,1,1,1]
[3,3,2]
[1,3,2,2,5,2,3,7]

import java.util.Arrays;class Solution {public int findLHS(int[] nums) {if (nums.length == 1) return 0;Arrays.sort(nums);int maxSum = 0;int numPre = Integer.MAX_VALUE;int cntPre = 0;int cntCur = 1;for (int i = 0; i < nums.length - 1; i++) {if (nums[i] == nums[i + 1]) {cntCur++;} else {if (numPre + 1 == nums[i]) { // update maxSum only when it's continuousmaxSum = Math.max(maxSum, cntPre + cntCur);}cntPre = cntCur;cntCur = 1;numPre = nums[i];}}// boundary: the last numberif (nums[nums.length - 2] != nums[nums.length - 1]) {cntPre = cntCur;cntCur = 1;}if (numPre + 1 == nums[nums.length - 1]) { // update maxSum only when it's continuousmaxSum = Math.max(maxSum, cntPre + cntCur);}return maxSum;}
}

评论区优雅解法

排序后，用两个指针，类似于窗口

class Solution {public int findLHS(int[] nums) {Arrays.sort(nums);int begin = 0,res = 0;for(int end = 0;end < nums.length;end++){while(nums[end] - nums[begin] > 1)begin++;if(nums[end] - nums[begin] == 1)res = Math.max(res,end - begin + 1);}return res;}
}

leetcode 594. Longest Harmonious Subsequence | 594. 最长和谐子序列相关推荐

leetcode 300. Longest Increasing Subsequence | 300. 最长递增子序列（动态规划）
题目 https://leetcode.com/problems/longest-increasing-subsequence/ 题解难得有官方题解的一道题. 参考:https://leetcode ...
leetcode 1143. Longest Common Subsequence | 1143. 最长公共子序列（动态规划，暴力递归-＞傻缓存-＞dp）
题目 https://leetcode.com/problems/longest-common-subsequence/ 题解经典的暴力递归 -> 傻缓存 -> dp 题目,以 &qu ...
leetcode （Longest Harmonious Subsequence）
Title:Longest Harmonious Subsequence 594 Difficulty:Easy 原题leetcode地址: https://leetcode.com/probl ...
LeetCode 594. Longest Harmonious Subsequence
题目: We define a harmonious array is an array where the difference between its maximum value and its ...
594. Longest Harmonious Subsequence
本题题意: 在一个数组中,找一个这样的和谐数组,他们的最大值和最小值的差值正好是1. Input: [1,3,2,2,5,2,3,7] Output: 5 Explanation: The longe ...
leetcode（300）—— Longest Increasing Subsequence（最长递增子序列）
参考 Python 解法: 动态规划 -- 最长递增子序列(LIS) 原题位置:Longest Increasing Subsequence | LeetCode OJ 题目的说明: 严格递增: 子序 ...
leetcode 516. Longest Palindromic Subsequence | 516. 最长回文子序列（递归 -＞傻缓存 -＞DP）
题目 https://leetcode.com/problems/longest-palindromic-subsequence/ 题解 1.递归(超时) 递归 -> 傻缓存 ->DP c ...
C#LeetCode刷题之#594-最长和谐子序列（Longest Harmonious Subsequence）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3800 访问. 和谐数组是指一个数组里元素的最大值和最小值之间的差 ...
Leetcode 594. 最长和谐子序列 C++
Leetcode 594. 最长和谐子序列题目和谐数组是指一个数组里元素的最大值和最小值之间的差别正好是1. 现在,给定一个整数数组,你需要在所有可能的子序列中找到最长的和谐子序列的长度. 示例: ...

leetcode 594. Longest Harmonious Subsequence | 594. 最长和谐子序列

题目

题解

我的解法

评论区优雅解法

leetcode 594. Longest Harmonious Subsequence | 594. 最长和谐子序列相关推荐

最新文章

热门文章