solves lemonade change

Author: anishLearnsToCode

README.md

@@ -231,7 +231,7 @@
 | 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | |
 | 852 | [Peak Index in Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [![Java](assets/java.png)](src/PeakIndexInMountainArray.java) |
 | 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [![Java](assets/java.png)](src/BuddyStrings.java) |
-| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | |
+| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [![Java](assets/java.png)](src/LemonadeChange.java) |
 | 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | |
 | 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | |
 | 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | |

src/LemonadeChange.java

@@ -0,0 +1,20 @@
+public class LemonadeChange {
+    public boolean lemonadeChange(int[] bills) {
+        int fives = 0, tenners = 0, twenties = 0;
+        for (int i = 0 ; i < bills.length && fives >= 0 && tenners >= 0 && twenties >= 0 ; i++) {
+            if (bills[i] == 20) {
+                if (tenners > 0) {
+                    tenners--;
+                    fives--;
+                } else {
+                    fives -= 3;
+                }
+                twenties++;
+            } else if (bills[i] == 10) {
+                fives--;
+                tenners++;
+            } else fives++;
+        }
+        return fives >=0 && tenners >= 0 && twenties >= 0;
+    }
+}