[LeetCode] Search Insert Position
2014-05-23 10:07
197 查看
题目:
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.
解答:
思路:
这题真的没的说了,不明白为什么A率不是第一,哈哈~
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) { int i = 0; for(i = 0; i < n; i++) { if(A[i] >= target) { break; } } return i; } };
思路:
这题真的没的说了,不明白为什么A率不是第一,哈哈~
相关文章推荐
- [leetcode]: 35. Search Insert Position
- leetcode-Search Insert Position
- leetcode-35 Search Insert Position
- leetcode解题方案--035--Search Insert Position
- LeetCode-35-Search Insert Position(二分法)-Medium
- Leetcode_35_Search Insert Position
- LeetCode 35. 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(C语言)
- [LeetCode]Search Insert Position@python
- LeetCode:Search Insert Position
- Leetcode 35 Search Insert Position 二分查找插入数字位置
- [LeetCode] Search Insert Position
- [LeetCode]problem 35. Search Insert Position
- LeetCode: Search Insert Position
- 【LeetCode从零单刷】Search Insert Position
- LeetCode--Search Insert Position