【LeetCode】Search Insert Position
2014-05-07 23:15
155 查看
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.
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
public class Solution { public int searchInsert(int[] A, int target) { if(target<A[0]){ return 0; } if(target>A[A.length-1]){ return A.length; } int re=0;; for(int i=0;i<A.length;i++){ if(A[i]==target){ re=i; break; } if(A[i]>target){ re = i; break; } } return re; } }
相关文章推荐
- LeetCode: Search Insert Position, Count and Say, Maximum Subarray, Length of Last Word
- LeetCode | Search Insert Position
- LeetCode:Search Insert Position
- LeetCode | Search Insert Position(查找插入位置)
- leetcode之Search Insert Position
- leetcode 35. Search Insert Position
- Leetcode35. Search Insert Position
- 【leetcode】 search Insert Position(middle)
- LeetCode - Refresh - Search Insert Position
- Search Insert Position leetcode java
- LeetCode_Search Insert Position
- leetcode 虐我篇之(二十)Search Insert Position
- [leetcode]#35. Search Insert Position
- [Leetcode 23] 35 Search Insert Position
- leetcode--Search Insert Position
- LeetCode力扣之Search Insert Position
- 【LeetCode】Search Insert Position
- Search Insert Position 找适合插入的位置@LeetCode
- [leetcode]Binary Search-35. Search Insert Position
- [LeetCode35]Search Insert Position