leetcode - Search Insert Position
Posted gccbuaa
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode - Search Insert Position相关的知识,希望对你有一定的参考价值。
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 index = n; for (int i = 0; i < n; i++) { if(A[i] < target) { continue; } else { index = i; break; } } return index; } };
以上是关于leetcode - Search Insert Position的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 35. Search Insert Position
[leetcode]Binary Search-35. Search Insert Position
LeetCode OJ 35. Search Insert Position
LeetCode:35. Search Insert Position