From 4b5de9097d45d8f8b75c70ecf8451f0c1861dec3 Mon Sep 17 00:00:00 2001
From: snughnu <ksnughnu@gmail.com>
Date: Sat, 5 Jul 2025 20:25:48 +0900
Subject: [PATCH 1/2] =?UTF-8?q?lv2=5F=EB=A1=A4=EC=BC=80=EC=9D=B4=ED=81=AC?=
 =?UTF-8?q?=20=EC=9E=90=EB=A5=B4=EA=B8=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../Programmers_132265.swift"                 | 45 +++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 "snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_132265.swift"

diff --git "a/snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_132265.swift" "b/snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_132265.swift"
new file mode 100644
index 0000000..b161753
--- /dev/null
+++ "b/snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_132265.swift"
@@ -0,0 +1,45 @@
+import Foundation
+
+/*
+오답: 시간초과
+func solution(_ topping: [Int]) -> Int {
+    var count: Int = 0
+
+    for i in (1..<topping.count) {
+        let leftSet = Set(Array(topping[..<i]))
+        let rightSet = Set(Array(topping[i...]))
+
+        if leftSet.count == rightSet.count { count += 1 }
+    }
+
+    return count
+}
+*/
+
+func solution(_ topping: [Int]) -> Int {
+    var count: Int = 0
+    var leftSet: Set<Int> = []
+    var rightDict: [Int: Int] = [:]
+
+    // 먼저 모든 토핑을 rightDict에 저장
+    for top in topping {
+        rightDict[top, default: 0] += 1
+    }
+
+    // 왼쪽에서 하나씩 늘려가면서 비교하기
+    for i in (0..<topping.count) {
+        let t = topping[i]
+        leftSet.insert(t)
+
+        rightDict[t]! -= 1
+        if rightDict[t]! == 0 {
+            rightDict.removeValue(forKey: t)
+        }
+
+        if leftSet.count == rightDict.count {
+            count += 1
+        }
+    }
+
+    return count
+}

From be90ff3ae59e00ee975e31e1b286b8f008b5bf64 Mon Sep 17 00:00:00 2001
From: snughnu <ksnughnu@gmail.com>
Date: Tue, 8 Jul 2025 17:29:34 +0900
Subject: [PATCH 2/2] =?UTF-8?q?lv2=5F=EA=B8=B0=EB=8A=A5=EA=B0=9C=EB=B0=9C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../Programmers_42586.swift"                  | 54 +++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 "snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_42586.swift"

diff --git "a/snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_42586.swift" "b/snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_42586.swift"
new file mode 100644
index 0000000..1f67f6e
--- /dev/null
+++ "b/snughnu/7\354\243\274\354\260\250_\354\236\220\354\234\240\354\243\274\354\240\234/Programmers_42586.swift"
@@ -0,0 +1,54 @@
+func solution(_ progresses: [Int], _ speeds: [Int]) -> [Int] {
+    // 남은 배포일 계산
+    var days: [Int] = []
+    for i in 0..<progresses.count {
+        let remainDay = ((100 - progresses[i]) + (speeds[i] - 1)) / speeds[i]
+        days.append(remainDay)
+    }
+
+    // 스택에 넣으면서 결과 만들기
+    var stack: [Int] = []
+    var result: [Int] = []
+    for day in days {
+        if stack.isEmpty {
+            stack.append(day)
+        } else if day <= stack.last! {              // day가 top과 같거나 작으면 같은 배포일
+            stack.append(stack.last!)
+        } else {                                    // day가 top보다 크면 날짜 기록하고, stack 초기화(pop)
+            result.append(stack.count)
+            stack = [day]
+        }
+    }
+
+    if !stack.isEmpty {
+        result.append(stack.count)
+    }
+
+    return result
+}
+
+// 스택을 사용하지 않는 버전
+func solution2(_ progresses: [Int], _ speeds: [Int]) -> [Int] {
+    var days: [Int] = []
+    for i in 0..<progresses.count {
+        let remainDay = ((100 - progresses[i]) + (speeds[i] - 1)) / speeds[i]
+        days.append(remainDay)
+    }
+
+    var result: [Int] = []
+    var current = days[0]
+    var count = 1
+
+    for i in 1..<days.count {
+        if days[i] <= current {
+            count += 1
+        } else {
+            result.append(count)
+            current = days[i]
+            count = 1
+        }
+    }
+
+    result.append(count)
+    return result
+}