일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 |
Tags
- 시바견
- 315. Count of Smaller Numbers After Self
- Protocol
- kaggle
- LeetCode
- attribute
- shiba
- 파이썬
- DWG
- 30. Substring with Concatenation of All Words
- 컴퓨터의 구조
- Python Code
- iterator
- Generator
- 운영체제
- 밴픽
- Substring with Concatenation of All Words
- Convert Sorted List to Binary Search Tree
- 109. Convert Sorted List to Binary Search Tree
- Python Implementation
- 715. Range Module
- Decorator
- data science
- Regular Expression
- concurrency
- 43. Multiply Strings
- Class
- t1
- Python
- 프로그래머스
Archives
- Today
- Total
목록2024/02/16 (1)
Scribbling
[Java] 1481. Least Number of Unique Integers after K Removals
https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/?envType=daily-question&envId=2024-02-16 class Solution { public int findLeastNumOfUniqueInts(int[] arr, int k) { Map counter = new HashMap(); for (int num : arr) { counter.merge(num, 1, Integer::sum); } List list = new ArrayList(); for (Integer key : counter.keySet()) { Integer val = counter.get(key); List tmp = new ..
Computer Science/Java
2024. 2. 16. 21:06