二分查找
hmyqwe
这个作者很懒,什么都没留下…
展开
-
leetcode-1011-在 D 天内送达包裹的能力
class Solution { // // 二分查找左侧边界模板 public int shipWithinDays(int[] weights, int D) { // 载重可能的最小值 int left = getMax(weights); // 载重可能的最大值 int right = getSum(weights); while (left <= right) { in..原创 2021-04-06 16:14:25 · 64 阅读 · 0 评论 -
leetcode-875-爱吃香蕉的珂珂
class Solution { public int minEatingSpeed(int[] piles, int h) { // 套用二分查找左侧边界模板 int left = 1, right = getMaxPile(piles); while (left <= right) { int mid = left + (right - left) / 2; if (canFinishAll(piles, m.原创 2021-04-06 15:31:22 · 111 阅读 · 0 评论 -
算法模板-二分查找
二分查找值模板int mid = left + (right - left) / 2;// 等同于int mid = (left + right) / 2// 防止 left + right 过大溢出 int binary_search(int[] nums, int target) { int left = 0, right = nums.length - 1; while(left <= right) { int mid = left + (rig.原创 2021-04-06 14:43:32 · 60 阅读 · 0 评论