码迷,mamicode.com
首页 > 其他好文 > 详细

Search Insert Position

时间:2014-05-08 07:29:02      阅读:285      评论:0      收藏:0      [点我收藏+]

标签:style   blog   class   code   java   tar   

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

 

bubuko.com,布布扣
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;
        
    }
}
bubuko.com,布布扣

 

Search Insert Position,布布扣,bubuko.com

Search Insert Position

标签:style   blog   class   code   java   tar   

原文地址:http://www.cnblogs.com/yixianyixian/p/3715018.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!