LeetCode 솔루션 분류
[8/18] 1338. Reduce Array Size to The Half
본문
Medium
2712131Add to ListShareYou are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array.
Return the minimum size of the set so that at least half of the integers of the array are removed.
Example 1:
Input: arr = [3,3,3,3,5,5,5,2,2,7] Output: 2 Explanation: Choosing {3,7} will make the new array [5,5,5,2,2] which has size 5 (i.e equal to half of the size of the old array). Possible sets of size 2 are {3,5},{3,2},{5,2}. Choosing set {2,7} is not possible as it will make the new array [3,3,3,3,5,5,5] which has a size greater than half of the size of the old array.
Example 2:
Input: arr = [7,7,7,7,7,7] Output: 1 Explanation: The only possible set you can choose is {7}. This will make the new array empty.
Constraints:
2 <= arr.length <= 105arr.lengthis even.1 <= arr[i] <= 105
Accepted
154,894
Submissions
221,581
관련자료
-
링크
댓글 1
학부유학생님의 댓글
- 익명
- 작성일
import collections
class Solution:
def minSetSize(self, arr: List[int]) -> int:
og_len = len(arr)
counter = collections.Counter(arr)
freq_sorted = sorted([val for key, val in counter.items()])
removed = 0
set_num = 0
while removed < og_len//2:
removed += freq_sorted.pop()
set_num += 1
return set_num
