solve problem Lemonade Change

Author: P-ppc

README.md

@@ -170,6 +170,7 @@ All solutions will be accepted!
 |190|[Reverse Bits](https://leetcode-cn.com/problems/reverse-bits/description/)|[java/py/js](./algorithms/ReverseBits)|Easy|
 |400|[Nth Digits](https://leetcode-cn.com/problems/nth-digit/description/)|[java/py/js](./algorithms/NthDigits)|Easy|
 |160|[Intersection Of Two Linked Lists](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/description/)|[java/py/js](./algorithms/IntersectionOfLinkedLists)|Easy|
+|860|[LemonadeChange](https://leetcode-cn.com/problems/lemonade-change/description/)|[java/py/js](./algorithms/LemonadeChange)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/LemonadeChange/README.md

@@ -0,0 +1,2 @@
+# Lemonade Change
+This problem is easy to solve

algorithms/LemonadeChange/Solution.java

@@ -0,0 +1,34 @@
+class Solution {
+    public boolean lemonadeChange(int[] bills) {
+        Map<Integer, Integer> remains = new HashMap<Integer, Integer>();
+        remains.put(5, 0);
+        remains.put(10, 0);
+        
+        for (int bill : bills) {
+            int remains_5 = remains.get(5),
+                remains_10 = remains.get(10);
+            
+            if (bill == 5) {
+                remains.put(5, remains_5 + 1);
+            } else if (bill == 10) {
+                if (remains_5 > 0) {
+                    remains.put(5, remains_5 - 1);
+                    remains.put(10, remains_10 + 1);
+                } else {
+                    return false;
+                }
+            } else if (bill == 20) {
+                if (remains_10 > 0 && remains_5 > 0) {
+                    remains.put(5, remains_5 - 1);
+                    remains.put(10, remains_10 - 1);
+                } else if (remains_5 >= 3) {
+                    remains.put(5, remains_5 - 3);
+                } else {
+                    return false;
+                }
+            }
+        }
+        
+        return true;
+    }
+}

algorithms/LemonadeChange/solution.js

@@ -0,0 +1,36 @@
+/**
+ * @param {number[]} bills
+ * @return {boolean}
+ */
+var lemonadeChange = function(bills) {
+    let remains = {
+        5: 0,
+        10: 0
+    }
+    
+    for (let i = 0; i < bills.length; i++) {
+        let bill = bills[i]
+        
+        if (bill === 5) {
+            remains[5]++
+        } else if (bill === 10) {
+            if (remains[5] > 0) {
+                remains[5]--
+                remains[10]++
+            } else {
+                return false
+            }
+        } else if (bill === 20) {
+            if (remains[10] > 0 && remains[5] > 0) {
+                remains[5]--
+                remains[10]--
+            } else if (remains[5] >= 3) {
+                remains[5] -= 3
+            } else {
+                return false
+            }
+        }
+    }
+    
+    return true
+};

algorithms/LemonadeChange/solution.py

@@ -0,0 +1,30 @@
+class Solution(object):
+    def lemonadeChange(self, bills):
+        """
+        :type bills: List[int]
+        :rtype: bool
+        """
+        remains = {
+            5: 0,
+            10: 0
+        }
+        
+        for bill in bills:
+            if bill == 5:
+                remains[5] += 1
+            elif bill == 10:
+                if remains[5] > 0:
+                    remains[5] -= 1
+                    remains[10] += 1
+                else:
+                    return False
+            elif bill == 20:
+                if remains[10] > 0 and remains[5] > 0:
+                    remains[5] -= 1
+                    remains[10] -= 1
+                elif remains[5] >= 3:
+                    remains[5] -= 3
+                else:
+                    return False
+        
+        return True