LeetCode-Java-697. Degree of an Array

题目

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: 2
Explanation: 
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.

代码

主要是要记录其出现次数和其前后下标。

class Solution {
    public int findShortestSubArray(int[] nums) {
        HashMap<Integer,Integer> r = new HashMap<Integer,Integer>();
        HashMap<Integer,Integer> l = new HashMap<Integer,Integer>();
        HashMap<Integer,Integer> c = new HashMap<Integer,Integer>();
        int len = nums.length;
        for(int i=0;i<len;i++){
            int x = nums[i];
            if(l.get(x)==null){
                l.put(x,i);
            }
            r.put(x,i);
            c.put(x,c.getOrDefault(x,0)+1);
        }
        int ans = nums.length;
        int degree = Collections.max(c.values());
        for (int x: c.keySet()) {
            if (c.get(x) == degree) {
                ans = Math.min(ans, r.get(x) - l.get(x) + 1);
            }
        }
        return ans;

    }
}