[Queue] programmers Queue problemset

Author: Seogeurim

README.md

@@ -214,6 +214,8 @@
 | 03  |     | [SWEA-1225 암호생성기](./src/Queue/swea1225)           |        |
 | 04  |     | [Baekjoon-1158 요세푸스 문제](./src/Queue/P1158)        |        |
 | 05  |     | [Programmers 다리를 지나는 트럭](./src/Queue/prg42583)   |        |
+| 06  |     | [Programmers 기능개발](./src/Queue/prg42586)           |        |
+| 07  |     | [Programmers 프린터](./src/Queue/prg42587)            |        |
 
 ### Tree
 

src/Queue/prg42586/README.md

@@ -0,0 +1,3 @@
+## [programmers - 스택/큐] 기능개발
+
+![image](https://user-images.githubusercontent.com/22045163/115884403-d66eea00-a489-11eb-871c-a9b61c08bb68.png)

src/Queue/prg42586/Solution.java

@@ -0,0 +1,37 @@
+package Queue.prg42586;
+
+import java.util.*;
+
+class Solution {
+    public int[] solution(int[] progresses, int[] speeds) {
+
+        List<Integer> list = new ArrayList<>();
+        int[] time = new int[speeds.length];
+
+        for (int i = 0; i < speeds.length; i++) {
+            time[i] = (int) Math.ceil((double) (100 - progresses[i]) / speeds[i]);
+        }
+
+        int cur = time[0], cnt = 1;
+        for (int i = 1; i < speeds.length; i++) {
+            if (cur < time[i]) {
+                list.add(cnt);
+                cur = time[i];
+                cnt = 1;
+            } else {
+                cnt ++;
+            }
+        }
+        list.add(cnt);
+
+        return listToArr(list);
+    }
+
+    private int[] listToArr(List<Integer> list) {
+        int[] res = new int[list.size()];
+        for (int i = 0; i < list.size(); i++) {
+            res[i] = list.get(i);
+        }
+        return res;
+    }
+}

src/Queue/prg42587/README.md

@@ -0,0 +1,3 @@
+## [programmers - 스택/큐] 프린터
+
+![image](https://user-images.githubusercontent.com/22045163/115884265-ab849600-a489-11eb-8f79-de2b0df65c66.png)

src/Queue/prg42587/Solution.java

@@ -0,0 +1,32 @@
+package Queue.prg42587;
+
+import java.util.*;
+
+class Solution {
+    public int solution(int[] priorities, int location) {
+
+        int N = priorities.length;
+        LinkedList<Integer> q = new LinkedList<>();
+
+        for (int i = 0; i < N; i++) q.offer(i);
+
+        int cnt = 0;
+        while (!q.isEmpty()) {
+            int J = q.removeFirst();
+            boolean print = true;
+            for (int i = 0; i < q.size(); i++) {
+                if (priorities[J] < priorities[q.get(i)]) {
+                    q.addLast(J);
+                    print = false;
+                    break;
+                }
+            }
+            if (print) {
+                cnt ++;
+                if (J == location) return cnt;
+            }
+        }
+
+        return N;
+    }
+}