Merge pull request #79 from AlgoLeadMe/23-alstjr7437

23-alstjr7437

alstjr7437/BFS/연결-요소의-개수.swift

@@ -41,4 +41,4 @@ for i in 1...n{
     }
 }
 
-print(result)
+print(result)

alstjr7437/README.md

@@ -21,6 +21,7 @@
 | 17차시 | 2024.03.16 |  DP  | <a href="https://www.acmicpc.net/problem/2228">구간 나누기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/61 |
 | 18차시 | 2024.03.23 |  다익스트라  | <a href="https://www.acmicpc.net/problem/1753">최단 경로</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/66 |
 | 19차시 | 2024.03.27 |  문자열  | <a href="https://www.acmicpc.net/problem/5525">IOIOI</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/67 |
-| 20차시 | 2024.04.03 |  BFS  | <a href="https://www.acmicpc.net/problem/1697">숨바꼭질</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/70 |
+| 22차시 | 2024.04.13 |  BFS  | <a href="https://www.acmicpc.net/problem/11724">연결 요소의 개수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/78 |
 | 21차시 | 2024.04.06 |  비트마스킹  | <a href="https://www.acmicpc.net/problem/11723">집합</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/74 |
-| 22차시 | 2024.04.13 |  BFS  | <a href="https://www.acmicpc.net/problem/11724">연결 요소의 개수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/78 |
+| 22차시 | 2024.04.13 |  BFS  | <a href="https://www.acmicpc.net/problem/11724">연결 요소의 개수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/78 |
+| 23차시 | 2024.05.01 |  큐  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42587">프로세스</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/79 |

alstjr7437/큐/프로세스.swift

@@ -0,0 +1,29 @@
+import Foundation
+
+func solution(_ priorities:[Int], _ location:Int) -> Int {
+    var result = 0
+    var priorities = priorities
+    var location = location
+
+    while priorities.count != 0 {
+        location -= 1
+        let p_max = priorities.max()!
+        let temp = priorities[0]
+        if p_max != temp {  // max가 아닐 경우(빼야할 경우가 아닌 경우)
+            priorities.append(temp) // 뒤에 넣기
+            priorities.removeFirst()    // 처음꺼 빼기
+            if location < 0 {   // location이 음수면 제일 뒤에서 부터
+                location = priorities.count - 1
+            }
+        } else {    // max일 경우(빼야할 경우)
+            priorities.removeFirst()
+            result += 1
+            if location < 0 {   // location이 적절하게 오면 멈추기
+                break
+            }
+        }
+
+    }
+
+    return result
+}