【Leetcode】Search Insert Position in JAVA
2014-11-16 00:53
357 查看
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; for(int i=0;i<A.length;i++){ if(A[i]==target) return i; if(A[i]<target) { if(i+1>A.length-1||A[i+1]>target) return i+1; } } return A.length-1; } }
相关文章推荐
- LeetCode 35 Search Insert Position (C,C++,Java,Python)
- [LeetCode][Java] Search Insert Position
- [LeetCode-Java]35. Search Insert Position
- [Leetcode] Search Insert Position (Java)
- LeetCode(035) Search Insert Position (Java)
- [leetcode]35. Search Insert Position(Java)
- [LeetCode][Java] Search Insert Position
- Leetcode 35. Search Insert Position (Medium) (java)
- 【LeetCode-面试算法经典-Java实现】【035-Search Insert Position(搜索插入位置)】
- leetcode解题之35#Search Insert Position Java版 递归和非递归实现
- leetcode:Search Insert Position 【Java 】
- Search Insert Position leetcode java
- Java for LeetCode 035 Search Insert Position
- Java [leetcode 35]Search Insert Position
- [LeetCode] Search in Rotated Sorted Array、Search for a Range、Search Insert Position、Search in Rotate
- LeetCode 35 -Search Insert Position ( JAVA )
- Search Insert Position leetcode java
- [leetcode]35. Search Insert Position(java)
- [LeetCode][Java] Search Insert Position
- LeetCode : Search Insert Position [java]