| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 | 30 | 31 |
Tags
- data science
- t1
- 운영체제
- concurrency
- DWG
- shiba
- Python Implementation
- attribute
- Class
- 밴픽
- LeetCode
- Protocol
- Python
- 프로그래머스
- kaggle
- Convert Sorted List to Binary Search Tree
- Generator
- 109. Convert Sorted List to Binary Search Tree
- 시바견
- 30. Substring with Concatenation of All Words
- 715. Range Module
- iterator
- 컴퓨터의 구조
- 315. Count of Smaller Numbers After Self
- Decorator
- Regular Expression
- Substring with Concatenation of All Words
- Python Code
- 파이썬
- 43. Multiply Strings
Archives
- Today
- Total
목록LeetCode: 1606. Find Servers That Handled Most Number of Requests (1)
Scribbling
[Java] LeetCode: 1606. Find Servers That Handled Most Number of Requests
https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests/description/ class Solution { public List busiestServers(int k, int[] arrival, int[] load) { int[] counter = new int[k]; TreeSet servers = new TreeSet(); for (int i = 0; i < k; i++) { servers.add(i); } // [endTime, serverId] Queue schedules = new PriorityQueue(new Comparator() { @Override public int compare(int[] o1,..
Computer Science/Java
2023. 8. 27. 04:41