LeetCode 594. Longest Harmonious Subsequence

题目：
We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.

Now, given an integer array, you need to find the length of its longest harmonious subsequence among all its possible subsequences.

Example 1:

Input: [1,3,2,2,5,2,3,7]
Output: 5
Explanation: The longest harmonious subsequence is [3,2,2,2,3].

Note: The length of the input array will not exceed 20,000.

思路：
就是要计算从vector中取数，组成一个子vector，这具子vector的最大数比最小数最大只能大1，不要求顺序。我的思路是先排序，将所有数放到map里来计算。具体思路见注释~

代码：

class Solution {
public:int findLHS(vector<int>& nums) {sort(nums.begin(),nums.end());//先排序int len=nums.size();//计算nums的长度，如果为0直接返回0if(len<1){return 0;}map<int,int> res;for(int i=0;i<len;++i){//将所有数放到一个map里，即每个数出现的次数知道了res[nums[i]]++;}map<int, int>::iterator iter1 = res.begin();//iter1从第一个元素开始，iter2从第二个开始map<int, int>::iterator iter2 = iter1;++iter2;int ret = 0;for (; iter2 != res.end(); iter1++, iter2++){if (res.count(iter1->first+1)){//如果前一个map元素对应的first的值+1，也在map中有ret = max(ret, iter1->second + iter2->second);//那么ret就取ret和连着两个map元素的second}                                                 //因为second存的是这个数出现的次数}return ret;    }
};

输出结果： 112ms

LeetCode 594. Longest Harmonious Subsequence相关推荐

leetcode 594. Longest Harmonious Subsequence | 594. 最长和谐子序列
题目 https://leetcode-cn.com/problems/longest-harmonious-subsequence/ 题解我的解法测试用例 [1] [1,2] [2,1] [3, ...
leetcode （Longest Harmonious Subsequence）
Title:Longest Harmonious Subsequence 594 Difficulty:Easy 原题leetcode地址: https://leetcode.com/probl ...
594. Longest Harmonious Subsequence
本题题意: 在一个数组中,找一个这样的和谐数组,他们的最大值和最小值的差值正好是1. Input: [1,3,2,2,5,2,3,7] Output: 5 Explanation: The longe ...
C#LeetCode刷题之#594-最长和谐子序列（Longest Harmonious Subsequence）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3800 访问. 和谐数组是指一个数组里元素的最大值和最小值之间的差 ...
【暴力】LeetCode 300. Longest Increasing Subsequence
LeetCode 300. Longest Increasing Subsequence Solution1:我的答案暴力搜索,时间复杂度O(n2)O(n2)O(n^2) class Solutio ...
【动态规划回文串11】LeetCode 516. Longest Palindromic Subsequence
LeetCode 516. Longest Palindromic Subsequence 本博客转载自:http://www.cnblogs.com/grandyang/p/6493182.html ...
leetcode 300. Longest Increasing Subsequence | 300. 最长递增子序列（动态规划）
题目 https://leetcode.com/problems/longest-increasing-subsequence/ 题解难得有官方题解的一道题. 参考:https://leetcode ...
LeetCode 521. Longest Uncommon Subsequence I
题目: Given a group of two strings, you need to find the longest uncommon subsequence of this group of ...
[leetcode] 300. Longest Increasing Subsequence (Medium)
题意: 求最长增长的子序列的长度. 思路: 利用DP存取以i作为最大点的子序列长度. Runtime: 20 ms, faster than 35.21% of C++ online submissi ...

LeetCode 594. Longest Harmonious Subsequence

LeetCode 594. Longest Harmonious Subsequence相关推荐

最新文章

热门文章