g0001_0100.s0035_search_insert_position.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0001_0100.s0035_search_insert_position;
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
// #Binary_Search_I_Day_2 #2022_06_15_Time_0_ms_(100.00%)_Space_44.2_MB_(8.12%)
public class Solution {
public int searchInsert(int[] nums, int target) {
int lo = 0;
int hi = nums.length - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (target == nums[mid]) {
return mid;
} else if (target < nums[mid]) {
hi = mid - 1;
} else if (target > nums[mid]) {
lo = mid + 1;
}
}
return lo;
}
}