-
Notifications
You must be signed in to change notification settings - Fork 820
/
LemonadeChange.java
78 lines (75 loc) · 2.39 KB
/
LemonadeChange.java
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/* (C) 2024 YourCompanyName */
package greedy;
/**
* Created by gouthamvidyapradhan on 26/04/2019
*
* <p>At a lemonade stand, each lemonade costs $5.
*
* <p>Customers are standing in a queue to buy from you, and order one at a time (in the order
* specified by bills).
*
* <p>Each customer will only buy one lemonade and pay with either a $5, $10, or $20 bill. You must
* provide the correct change to each customer, so that the net transaction is that the customer
* pays $5.
*
* <p>Note that you don't have any change in hand at first.
*
* <p>Return true if and only if you can provide every customer with correct change.
*
* <p>Example 1:
*
* <p>Input: [5,5,5,10,20] Output: true Explanation: From the first 3 customers, we collect three $5
* bills in order. From the fourth customer, we collect a $10 bill and give back a $5. From the
* fifth customer, we give a $10 bill and a $5 bill. Since all customers got correct change, we
* output true. Example 2:
*
* <p>Input: [5,5,10] Output: true Example 3:
*
* <p>Input: [10,10] Output: false Example 4:
*
* <p>Input: [5,5,10,10,20] Output: false Explanation: From the first two customers in order, we
* collect two $5 bills. For the next two customers in order, we collect a $10 bill and give back a
* $5 bill. For the last customer, we can't give change of $15 back because we only have two $10
* bills. Since not every customer received correct change, the answer is false.
*
* <p>Note:
*
* <p>0 <= bills.length <= 10000 bills[i] will be either 5, 10, or 20.
*
* <p>Solution: Store the count of number of five's and tens's. In case of change 15 return a 10 + 5
* (if 10 is not available then, return 5 + 5 + 5 if three fives are available) Since we are
* choosing a 10 + 5 instead of 5 + 5 + 5, this problem holds a greedy property
*/
public class LemonadeChange {
/**
* Main method
*
* @param args
*/
public static void main(String[] args) {}
public boolean lemonadeChange(int[] bills) {
int five = 0, ten = 0;
for (int b : bills) {
if (b == 5) {
five++;
} else if (b == 10) {
ten++;
if (five > 0) {
five--;
} else {
return false;
}
} else {
if (ten > 0 && five > 0) {
ten--;
five--;
} else if (five > 2) {
five -= 3;
} else {
return false;
}
}
}
return true;
}
}