Leetcode
2020.05.05 12:01

697. Degree of an Array

조회 수 628 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

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) {
            Map<Integer, Integer> hmap = new HashMap<>();
            
            int degree = -1;
            //int number = nums[0];
            
            for(int num : nums){
                int count = hmap.getOrDefault(num, 0) + 1;
                if(degree < count){
                    degree = count;
                    //number = num;
                }
                hmap.put(num, count);
            }
            
            int minVal = Integer.MAX_VALUE;
            
            for(Map.Entry<Integer, Integer> item : hmap.entrySet()){
                if(item.getValue() == degree){
                    int number = item.getKey();
                    int left = -1;
                    int right = -1;
                    int len = nums.length;
                    for(int i=0; i<len; i++){
                        if(nums[i] == number && left == -1){
                            left = i;
                        }
    
                        if(nums[len-1-i] == number && right == -1){
                            right = len - 1 - i;
                        }
                    }
    
                    len = right < left ? 0 : right - left + 1;
                    if(minVal > len){
                        minVal = len;
                    }
                }
            }
            
            return minVal;
        }
    }


    [문제] https://leetcode.com/problems/degree-of-an-array/



    ?

    List of Articles
    번호 분류 제목 글쓴이 날짜 조회 수
    77 Leetcode 720. Longest Word in Dictionary hooni 2020.05.07 668
    76 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 569
    75 Leetcode 56. Merge Intervals hooni 2020.05.05 529
    74 Leetcode 844. Backspace String Compare hooni 2020.05.05 538
    73 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 552
    » Leetcode 697. Degree of an Array hooni 2020.05.05 628
    71 Leetcode 605. Can Place Flowers hooni 2020.05.05 541
    70 Leetcode 724. Find Pivot Index hooni 2020.05.05 560
    69 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 510
    68 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 517
    67 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 570
    66 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 538
    65 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 527
    64 Leetcode 876. Middle of the Linked List hooni 2020.05.04 515
    63 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 501
    62 Leetcode 997. Find the Town Judge hooni 2020.05.02 562
    61 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 493
    60 Leetcode 687. Longest Univalue Path hooni 2020.05.01 570
    59 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 584
    58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 570
    Board Pagination Prev 1 2 3 4 Next
    / 4