2025-05-17提交
This commit is contained in:
24
35.search-insert-position.java
Normal file
24
35.search-insert-position.java
Normal file
@@ -0,0 +1,24 @@
|
||||
/*
|
||||
* @lc app=leetcode id=35 lang=java
|
||||
*
|
||||
* [35] Search Insert Position
|
||||
*/
|
||||
|
||||
// @lc code=start
|
||||
class Solution {
|
||||
public int searchInsert(int[] nums, int target) {
|
||||
int l=0, r = nums.length;
|
||||
int m;
|
||||
while(l<r) {
|
||||
m = l + (r-l)/2;
|
||||
if(nums[m] >= target) {
|
||||
r = m;
|
||||
} else {
|
||||
l = m + 1;
|
||||
}
|
||||
}
|
||||
return l;
|
||||
}
|
||||
}
|
||||
// @lc code=end
|
||||
|
||||
Reference in New Issue
Block a user