Longest Harmonious Subsequence问题及解法
来源:互联网 发布:怎么改路由器的mac地址 编辑:程序博客网 时间:2024/06/09 21:18
问题描述:
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.
示例:
Input: [1,3,2,2,5,2,3,7]Output: 5Explanation: The longest harmonious subsequence is [3,2,2,2,3].
问题分析:
将数组排序后,计算每个数出现的次数,相邻的数之差绝对值若为1,则将两数出现的次数相加得到一个和sum,统计sum的最大值即可。
过程详见代码:
if(nums.empty()) return 0; sort(nums.begin(), nums.end());int first = 1, second = 1;int res = 0;int a, b;int i = 0;while (i + 1 < nums.size() && nums[i] == nums[i + 1]){first++;i++;}a = nums[i]; i++;for (; i < nums.size();i++){b = nums[i];while (i + 1 < nums.size() && nums[i] == nums[i + 1]){second++;i++;}if (b - a == 1) res = max(res, first + second);first = second;second = 1;a = b;}return res;
阅读全文
0 0
- Longest Harmonious Subsequence问题及解法
- Longest Uncommon Subsequence I问题及解法
- Longest Continuous Increasing Subsequence 问题及解法
- Longest Palindromic Subsequence问题及解法
- Longest Increasing Subsequence问题及解法
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- leetcode[Longest Harmonious Subsequence]
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- LeetCode594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- LeetCode 594. Longest Harmonious Subsequence
- [leetcode]594. Longest Harmonious Subsequence
- [LeetCode]594. Longest Harmonious Subsequence
- [leetcode]: 594. Longest Harmonious Subsequence
- [LeetCode]594.Longest Harmonious Subsequence
- 为什么大型科技公司更会发生人员流失 标准 ceo 软件 技术 图 阅读2479 原文:Why Good People Leave Large Tech Companies 作者:steve
- node学习-修改源
- Haproxy相关概念解析
- Java线程状态
- 修改bug时需要注意问题
- Longest Harmonious Subsequence问题及解法
- 多线程代码
- C++多线程编程经验总结
- python深度学习之销量预测
- PowerDesigner最基础的使用方法入门学习
- 手写JAVA NIO实现Socket通信及其过程中注意的问题
- 数据库——(14)变量
- 笨方法学Python 习题 3: 数字和数学计算
- Linux文档目录