Binary search Java solution


  • 0
    F
    public class Solution {
        public int searchInsert(int[] nums, int target) {
            int l = 0;
            int r = nums.length - 1;
            
            while (l <= r) {
                int mid = (l + r) / 2;
                if (nums[mid] == target) return mid;
                
                if (nums[mid] < target) l = mid + 1;
                if (nums[mid] > target) r = mid - 1;
            }
            
            return l;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.