【leetcode】1482. Minimum Number of Days to Make m Bouquets
提交代码class Solution { public int minDays(int[] bloomDay, int m, int k) { int[] bd=bloomDay.clone(); Arrays.sort(bloomDay); int i=0,j=bloomDay.length-1,mid=(i+j)/2; while(i<j) { if(i==j-1) { if(hasBouquet(