Notice
Recent Posts
Recent Comments
- Today
- Total
04-13 23:05
Tags
- ๊ตฌํ
- database
- ์กธ์ ์ํ
- dp
- MST
- CS
- ํ๋ก๊ทธ๋๋จธ์ค
- ์๋ฐ
- leetcode
- ์๋ฃ๊ตฌ์กฐ
- Graph
- ๋ฌธ๋ฒ
- ๋ฐฑ์๋
- java
- ๋ฒจ๋งํฌ๋
- OOP
- tree
- ๋ค์ต์คํธ๋ผ
- ๊ทธ๋ฆฌ๋
- ์๋ฐ์์ ์
- ์ธํด
- spring
- array
- Algorithm
- BFS
- PS
- ์์์ ๋ ฌ
- ๋ฐ์ดํฐ๋ฒ ์ด์ค
- pytorch
- ๋ฐฑ์ค
Link
Partially Committed
[ํ] ๊ธฐ๋ฅ๊ฐ๋ฐ (JAVA) ๋ณธ๋ฌธ
728x90
๋ฐ์ํ
SMALL
https://school.programmers.co.kr/learn/courses/30/lessons/42586?language=java
ํ๋ก๊ทธ๋๋จธ์ค
์ฝ๋ ์ค์ฌ์ ๊ฐ๋ฐ์ ์ฑ์ฉ. ์คํ ๊ธฐ๋ฐ์ ํฌ์ง์ ๋งค์นญ. ํ๋ก๊ทธ๋๋จธ์ค์ ๊ฐ๋ฐ์ ๋ง์ถคํ ํ๋กํ์ ๋ฑ๋กํ๊ณ , ๋์ ๊ธฐ์ ๊ถํฉ์ด ์ ๋ง๋ ๊ธฐ์ ๋ค์ ๋งค์นญ ๋ฐ์ผ์ธ์.
programmers.co.kr
import java.io.IOException;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
class Solution {
public int[] solution(int[] progresses, int[] speeds) throws IOException {
ArrayList<Integer> answer = new ArrayList<>();
ArrayList<Integer> arr = new ArrayList<>();
Queue<Integer> q = new LinkedList<>();
int task = 0;
for (int i = 0; i < progresses.length; i++) {
task = (int) Math.ceil(((100 - progresses[i]) / (double) speeds[i]));
q.add(task);
}
while (!q.isEmpty()) {
int cnt = 1;
int day = q.poll();
while (!q.isEmpty() && day >= q.peek()) {
cnt++;
q.poll();
}
answer.add(cnt);
}
return answer.stream().mapToInt(Integer::intValue).toArray();
}
}
728x90
๋ฐ์ํ
LIST
'๐ฅ Algorithm || ๋ฌธ์ ํ์ด > PS' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[CH01] ๊ตฌ๊ฐํฉ (0) | 2022.09.09 |
---|---|
[์ฐ์ ์์ํ] ํ๋ฆฐํฐ (์๋ฐ) (0) | 2022.09.04 |
[์คํ/ํ] ์ฌ๋ฐ๋ฅธ ๊ดํธ (JAVA) (0) | 2022.09.03 |
[๋ฐฐ์ด] ๊ฐ์ ์ซ์๋ ์ซ์ด (JAVA) (0) | 2022.09.02 |
[์ ๋ ฌ] ๊ฐ์ฅ ํฐ ์ (JAVA) (0) | 2022.09.02 |