Search Insert Position
来源:互联网 发布:梦里花落知多少百度云 编辑:程序博客网 时间:2024/04/29 20:18
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) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (n==0)
return 0;
if (target<A[0])
return 0;
for (int i=0;i<n-1;i++){
if (target==A[i])
return i;
else if (target>A[i] && target<A[i+1])
return i+1;
}
if (target==A[n-1])
return n-1;
else
return n;
}
};
- LeetCode: Search Insert Position
- Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode34:Search Insert Position
- Search Insert Position
- [35]Search Insert Position
- Search Insert Position
- Search Insert Position
- [LeetCode]Search Insert Position
- Search Insert Position
- [LeetCode] Search Insert Position
- Search Insert Position
- Search Insert Position
- Subsets II -- LeetCode
- time_after那些事儿
- LRUCache
- How to install NDK in window and compile ndk project
- C# 启动外部程序的几种方法
- Search Insert Position
- Reverse Linked List II -- LeetCode
- Single Number II
- Android开发Activity之间传递及获取数据
- ActionBar隐藏修改图标和标题
- Evaluate Reversed Polish Notation
- ActionBar自定义背景
- Populating Next Right Pointers in Each Node
- Remove Duplicates from Sorted List