LeetCode | Search Insert Position
2013-09-15 22:53
295 查看
题目:
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
思路:
遍历一遍找出第一个大于等于target的数即可。代码:
class Solution { public: int searchInsert(int A[], int n, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function for(int i = 0; i < n; i++) { if(A[i] >= target) { return i; } } return n; } };
相关文章推荐
- LeetCode 35. Search Insert Position
- 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 By python]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