From 676302f5a3eb28becdc0fd9def1f90af24e372d4 Mon Sep 17 00:00:00 2001
From: SinnoLn <ok373737@naver.com>
Date: Tue, 22 Sep 2026 22:36:42 +0900
Subject: [PATCH] 860. Lemonade Change

---
 .../860. Lemonade Change.java"                | 41 +++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 "leetcode3/\354\235\264\354\247\204\355\235\254/860. Lemonade Change.java"

diff --git "a/leetcode3/\354\235\264\354\247\204\355\235\254/860. Lemonade Change.java" "b/leetcode3/\354\235\264\354\247\204\355\235\254/860. Lemonade Change.java"
new file mode 100644
index 000000000..af6104a4f
--- /dev/null
+++ "b/leetcode3/\354\235\264\354\247\204\355\235\254/860. Lemonade Change.java"	
@@ -0,0 +1,41 @@
+/* 
+
+1. 아이디어 : 거스름돈을 줄 수 있는지 체크 
+            10$ -> 5$ 1장
+            20$ -> 5$ 3장 or 10$ + 5$ 
+
+2. 시간복잡도 : O(N)
+
+3. 자료구조/알고리즘 : 완전탐색, 조건문 
+
+ */
+
+class Solution {
+    public boolean lemonadeChange(int[] bills) {
+
+        // 5 10
+        int[] money = new int[2];
+
+        for(int i=0; i<bills.length; i++) {
+           int pay = bills[i];
+
+           if(pay == 5) money[0]++;
+           else if(pay == 10) {
+                if(money[0] == 0) return false;
+                money[1]++;
+                money[0]--;
+           }
+           else {
+                // 5$ 3장 or 10$ + 5$
+                if(money[0]>0 && money[1]>0) {
+                    money[0]--;
+                    money[1]--;
+                }
+                else if (money[0] > 2) money[0] -=3;
+                else return false;
+           }
+        }
+
+        return true;
+    }
+}
\ No newline at end of file