[LeetCode]Search Insert Position
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
思考:二分搜索。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | class Solution { public : int searchInsert( int A[], int n, int target) { int left=0; int right=n-1; int mid; while (left<=right) { if (A[left]>target) return left; if (A[right]<target) return right+1; mid=(left+right)>>1; if (A[mid]==target) return mid; else if (A[mid]>target) right=mid-1; else left=mid+1; } } }; |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步