LeetCode Search Insert Position.
来源:程序员人生 发布时间:2015-04-07 08:36:21 阅读次数:3501次
1.题目
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
2.解决方案
class Solution { public: int searchInsert(int A[], int n, int target) { for(int i = 0; i < n; i++){ if(A[i] == target){ return i; }else if((i + 1) < n && A[i] < target && A[i+1] > target){ return i + 1; } if(i == n - 1 && A[i] < target){ return n; } if(A[0] > target){ return 0; } } return 0; } };
思路:简单数组题目,情况比较多,要仔细斟酌。
http://www.waitingfy.com/archives/1598
生活不易,码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠