| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 30. Substring with Concatenation of All Words
- Protocol
- concurrency
- Regular Expression
- 밴픽
- 운영체제
- DWG
- 43. Multiply Strings
- LeetCode
- attribute
- 715. Range Module
- Convert Sorted List to Binary Search Tree
- 프로그래머스
- 파이썬
- Python Implementation
- Python
- Class
- 시바견
- 컴퓨터의 구조
- kaggle
- Python Code
- shiba
- Decorator
- data science
- iterator
- Generator
- Substring with Concatenation of All Words
- t1
- 109. Convert Sorted List to Binary Search Tree
- 315. Count of Smaller Numbers After Self
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