697. Degree of an Array
来源:互联网 发布:激光颗粒物传感器 知乎 编辑:程序博客网 时间:2024/06/05 08:30
Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
Your task is to find the smallest possible length of a (contiguous) subarray of nums, that has the same degree as nums.
Example 1:
Input: [1, 2, 2, 3, 1]Output: 2Explanation: The input array has a degree of 2 because both elements 1 and 2 appear twice.Of the subarrays that have the same degree:[1, 2, 2, 3, 1], [1, 2, 2, 3], [2, 2, 3, 1], [1, 2, 2], [2, 2, 3], [2, 2]The shortest length is 2. So return 2.
Example 2:
Input: [1,2,2,3,1,4,2]Output: 6
Note:
nums.length will be between 1 and 50,000.nums[i] will be an integer between 0 and 49,999.
思路:
maxs记录元素的最大下标,mins记录元素的最小下标,cnts记录元素的出现个数,三者均是HashMap结构;
通过遍历记录元素与上三个对应的记录,只要找到最大次数对应的元素,则就找到了该元素的最大和最小下标,即找到了度相同的最小子数组。
时间复杂度:O(n);空间复杂度:O(1)
class Solution { public int findShortestSubArray(int[] nums) { Map<Integer, Integer> start = new HashMap<Integer, Integer>(); Map<Integer, Integer> end = new HashMap<Integer, Integer>(); Map<Integer, Integer> count = new HashMap<Integer, Integer>(); int maxCount = 0; for (int i = 0; i < nums.length; i++){ if (!count.containsKey(nums[i])){ count.put(nums[i], 0); start.put(nums[i], i); } count.put(nums[i], count.get(nums[i])+1); end.put(nums[i], i); maxCount = Math.max(maxCount, count.get(nums[i])); } int minLength = Integer.MAX_VALUE; for (Integer key : count.keySet()){ if (count.get(key) == maxCount){ minLength = Math.min(minLength,end.get(key)-start.get(key)+1); } } return minLength; }}
阅读全文
0 0
- 697. Degree of an Array
- 697. Degree of an Array
- 697. Degree of an Array
- 697. Degree of an Array
- 697. Degree of an Array
- LWC 54:697. Degree of an Array
- LeetCode 697. Degree of an Array
- leetcode-697. Degree of an Array
- 【LeetCode】697. Degree of an Array
- LeetCode-697. Degree of an Array
- 697 Degree of an Array
- leetCode-Degree of an Array
- leetcode 697. Degree of an Array数组的度
- Degree of an Array问题及解法
- LeetCode697. Degree of an Array解答
- LeetCode.697 Degree of an Array
- leetcode 697[easy]---Degree of an Array
- LeetCode-697:Degree of an Array (度相同的最小子数组)
- 二叉树的实现
- 分布式缓存Redis之持久化
- 'DataFrame' object has no attribute 'sort'
- 懒加载
- 后端过滤器的实现,
- 697. Degree of an Array
- 深入浅出Netty源码剖析
- servlet的拦截器和三大作用域
- 复习七:java基础知识点
- MATLAB Code For Inverse and Forward Kinematics (Newton-Raphson Method)
- java编程学习方法
- 多台服务器共享session问题
- 【备忘】2017年最新Python网络爬虫实战案例视频教程下载 共5章 34课
- mac上 mysql数据库自动备份