594. Longest Harmonious Subsequence
来源:互联网 发布:淘宝店怎么找上家 编辑:程序博客网 时间:2024/06/11 00:47
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: 5Explanation: The longest harmonious subsequence is [3,2,2,2,3].
Note: The length of the input array will not exceed 20,000.
class Solution { public int findLHS(int[] nums) { int result = 0; Map<Integer, Integer> map = new HashMap<Integer, Integer>(); for (int i = 0; i < nums.length; i++) { map.put(nums[i], map.getOrDefault(nums[i], 0) + 1); } for (Integer i: map.keySet()) { if (map.containsKey(i + 1)) { result = Math.max(result, map.get(i) + map.get(i + 1)); } } return result; }}
阅读全文
0 0
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. 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
- 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(Java)
- [LeetCode]594. Longest Harmonious Subsequence<HashMap>
- 594. Longest Harmonious Subsequence (map)
- Python filter()函数
- git cherry pick代码
- Spark常用算子详解汇总 : 实战案例、Java版本、Scala版本
- jzoj3578 【CEOI2013】Adriatic 巧妙dp
- 国内优秀的人工智能公司
- 594. Longest Harmonious Subsequence
- Oracle数据库 Insert 多行Values
- 框架和设计模式的区别
- error C2440: “类型转换”: 无法从“LPVOID”转换为“double
- Python网络数据采集
- Linux SoftEther VPN Client 使用说明
- Jmeter性能测试基础实战
- 数据库小结(面试)
- 唯快不破:UNIX网络编程--TCP网络编程中的listen