首页 > 其他 > 详细

Jan 16 - Search Insert Position; Array; Binary Search; Iteration&Recursion;---Iteration再补上

时间:2016-01-17 06:28:04      阅读:161      评论:0      收藏:0      [点我收藏+]

Recursion:

代码:

public class Solution {
    public int searchInsert(int[] nums, int target) {
        int len = nums.length;
        if(len == 0) return 0;
        return findPosition(nums, 0, len-1, target);
    }
    
    public int findPosition(int[] nums, int start, int end, int target){
        if(target > nums[end]) return end+1;
        if(target < nums[start]) return start;
        int mid = (start + end)/2;
        int num_mid = nums[mid];
        if(target == num_mid) return mid;
        if(target > num_mid) return findPosition(nums, mid+1, end, target);
        else return findPosition(nums, start, mid-1, target);
    }
}

  Iteration的之后再补上

Jan 16 - Search Insert Position; Array; Binary Search; Iteration&Recursion;---Iteration再补上

原文:http://www.cnblogs.com/5683yue/p/5136740.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!