摘要:
1、leetcode435 无重叠区间 代码 class Solution { public int eraseOverlapIntervals(int[][] intervals) { Arrays.sort(intervals,(a,b)->(a[0]-b[0])); int count = 1 阅读全文
posted @ 2023-02-19 19:47
黄三七
阅读(22)
评论(0)
推荐(0)
摘要:
1、leetcode860 柠檬水找零 class Solution { public boolean lemonadeChange(int[] bills) { if(bills[0] != 5) { return false; } int five_nums = 0; int ten_nums 阅读全文
posted @ 2023-02-19 19:46
黄三七
阅读(24)
评论(0)
推荐(0)

浙公网安备 33010602011771号