Leetcode 35. Search Insert Position (Medium) (java)

Leetcode 35. Search Insert Position (Medium) (java)

Tag: Array, Binary Search

Difficulty: Medium

/*35. Search Insert Position (Medium)Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Here are few examples.[1,3,5,6], 5 → 2[1,3,5,6], 2 → 1[1,3,5,6], 7 → 4[1,3,5,6], 0 → 0*/public class Solution {public int searchInsert(int[] nums, int target) {int l = 0, r = nums.length - 1;while (l <= r) {int mid = l + (r - l) / 2;if (nums[mid] == target) {return mid;}else if (nums[mid] > target) {r = mid - 1;}else {l = mid + 1;}}return l;}}