leetcode/algorithms/LemonadeChange/solution.js at master · P-ppc/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
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
};