[level 2] Title: 프로세스, Time: 1.10 ms, Memory: 75.5 MB -BaekjoonHub

Author: wonseokyoon

프로그래머스/2/42587. 프로세스/README.md

@@ -4,7 +4,7 @@
 
 ### 성능 요약
 
-메모리: 73.1 MB, 시간: 1.80 ms
+메모리: 75.5 MB, 시간: 1.10 ms
 
 ### 구분
 
@@ -16,7 +16,7 @@
 
 ### 제출 일자
 
-2025년 09월 01일 22:26:05
+2025년 09월 14일 23:43:35
 
 ### 문제 설명
 

프로그래머스/2/42587. 프로세스/프로세스.java

@@ -1,51 +1,35 @@
 import java.util.*;
+
 class Solution {
-    class Status {
-        int priority;
-        int location;
-        
-        public Status(int priority, int location){
-            this.priority = priority;
-            this.location = location;
-        }
-        
-        @Override
-        public String toString(){
-            return "[" + priority + "," + location +"]";
-        }
-    }
-    
     public int solution(int[] priorities, int location) {
-        Queue<Status> queue = new LinkedList<>();
-        List<Integer> list = new ArrayList<>();
-        int i = 0;
-        for(int priority : priorities){
-            Status status = new Status(priority,i++);
-            queue.offer(status);
-            list.add(priority);
+        int answer = 0;
+        int l = location;
+
+        Queue<Integer> que = new LinkedList<Integer>();
+        for(int i : priorities){
+            que.add(i);
         }
-        
-        // 정렬
-        Collections.sort(list,Collections.reverseOrder());
-        
-        int cnt = 1;
-        while(!queue.isEmpty()){
-            Status status = queue.poll();
-            int priority = status.priority;
-            int idx = status.location;
-            int target = list.get(0);
-            
-            if(target == priority) {
-                list.remove(0);    // 삭제
-                if(location == idx) return cnt;
-                cnt ++;
-            } else{
-                queue.offer(status);
+
+        Arrays.sort(priorities);
+        int size = priorities.length-1;
+
+
+
+        while(!que.isEmpty()){
+            Integer i = que.poll();
+            if(i == priorities[size - answer]){
+                answer++;
+                l--;
+                if(l <0)
+                    break;
+            }else{
+                que.add(i);
+                l--;
+                if(l<0)
+                    l=que.size()-1;
             }
         }
-        
-        
-        int answer = 0;
+
         return answer;
     }
-}
+}