Lemonade Change LeetCode solution in Java

1
class Solution {
2
  public boolean lemonadeChange(int[] bills) {
3
    int count5 = 0, count10 = 0;
4
    for (int p : bills) {
5
      if (p == 5) {
6
        count5++;
7
      } else if (p == 10) {
8
        if (count5 > 0) {
9
          count5--;
10
          count10++;
11
        } else {
12
          return false;
13
        }
14
      } else if (p == 20) {
15
        if (count5 > 0 && count10 > 0) {
16
          count5--;
17
          count10--;
18
        } else if (count5 == 0) {
19
          return false;
20
        } else if (count5 < 3) {
21
          return false;
22
        } else {
23
          count5 -= 3;
24
        }
25
      }
26
    }
27
    return true;
28
  }
29
}