摘要: 1 class Solution { 2 public boolean lemonadeChange(int[] bills) { 3 int count5 = 0, count10 = 0; 4 if(bills[0] != 5) return false; 5 for(int i = 0; i 阅读全文
posted @ 2020-12-10 18:05 加利亚的赤色恶魔 阅读(48) 评论(0) 推荐(0)