leetcode:Search Insert Position
2014-11-30 10:23
260 查看
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.
class Solution {
public:
int searchInsert(int A[], int n, int target) {
int i;
if (n == 1) {
if (target <= A[0]) {
return n - 1;
} else {
return n;
}
}
for (i = 0; i < n - 1; i++) {
if (target <= A[i]) {
return i;
}
if (target > A[i] && target <= A[i+1]) {
return i + 1;
}
}
return i + 1;
}
};
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) {
int i;
if (n == 1) {
if (target <= A[0]) {
return n - 1;
} else {
return n;
}
}
for (i = 0; i < n - 1; i++) {
if (target <= A[i]) {
return i;
}
if (target > A[i] && target <= A[i+1]) {
return i + 1;
}
}
return i + 1;
}
};
相关文章推荐
- leetcode:Search Insert Position
- leetcode 35. Search Insert Position
- [Leetcode]Search Insert Position
- [leetcode] 35.Search Insert Position
- LeetCode-Search Insert Position
- LeetCode 35. 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: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] Search Insert Position
- leetcode Search Insert Position Python