LeetCode-Search Insert Position
2013-09-18 17:03
204 查看
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.
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
class Solution { public: int searchInsert(int A[], int n, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function if(n==0)return 0; if(target<=A[0])return 0; else if(target>A[n-1])return n; int index1=-1; int start,end; start=0;end=n-1; while(start<=end){ int mid=(start+end)/2; if(A[mid]>=target){ end=mid-1; } else{ if(A[mid+1]>=target){ index1=mid; break; } else{ start=mid+1; } } } return index1+1; } };
相关文章推荐
- Search Insert Position (LeetCode)
- python写算法题:leetcode: 35. Search Insert Position
- LeetCode 35. Search Insert Position
- LeetCode - Search Insert Position - Frequent
- [LeetCode] Search Insert Position
- [Leetcode]Search Insert Position
- leetcode 之 Search Insert Position
- The Solution to Leetcode 35 Search Insert Position
- leetcode Search in Rotated Sorted Array & Search for a Range & Search Insert Position
- Leetcode: Search Insert Position
- Leetcode-Search Insert Position
- LeetCode @ Search Insert Position 二分查找
- 【leetcode】35. Search Insert Position
- LeetCode 35 Search Insert Position(插入排序)
- LeetCode:Search Insert Position
- leetCode->Search Insert Position
- [leetcode]35. Search Insert Position
- 【leetcode】【35】Search Insert Position
- leetcode--search_insert_position
- [leetcode]: 35. Search Insert Position