LeetCode_Search Insert Position
2013-04-25 16:55
246 查看
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
class Solution { public: int searchInsert(int A[], int n, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function int min = 0, max = n-1 ,mid; while(min <= max) { mid = min + (max -min)/2 ; //防止相加溢出 if( A[mid] == target) return mid; else if(A[mid] < target) min = mid +1; else max = mid -1 ; } return min ; } };
相关文章推荐
- 【LeetCode 35】Search Insert Position(Python)
- LeetCode--Search Insert Position
- Leetcode35: Search Insert Position
- LeetCode-Search Insert Position
- LeetCode——Search Insert Position
- [Leetcode] Search Insert Position
- Java for LeetCode 035 Search Insert Position
- Leetcode: Search Insert Position
- leetcode 35. Search Insert Position
- [leetcode]-35. Search Insert Position(C语言)
- [LeetCode]Search Insert Position@python
- Leetcode_Search Insert Position
- [LeetCode] Search Insert Position
- [leetcode][search] Search Insert Position
- Leetcode 35 Search Insert Position 二分查找插入数字位置
- [LeetCode]Search Insert Position
- leetcode_c++:Search insert position(035)
- LeetCode - 35. Search Insert Position
- LeetCode(55) Search Insert Position
- Leetcode_35_Search Insert Position