[leetcode] 35. 搜索插入位置(Java)(二分)
阿新 • • 發佈:2018-07-13
.com arch ref num clas ret bre solution etc
35. 搜索插入位置
二分,太簡單,沒啥好說的
class Solution { public int searchInsert(int[] nums, int target) { if (nums.length == 0) return 0; int i = 0, j = nums.length; int mid = (i + j) / 2; while (i < j) { if (nums[mid] == target) { return mid; } else if (nums[mid] > target) { if (j == mid) break; j = mid; mid = (i + j) / 2; } else { if (i == mid) break; i = mid; mid = (i + j) / 2; } } return j; } }
[leetcode] 35. 搜索插入位置(Java)(二分)