首页 > 其他 > 详细

Closest Number in Sorted Array

时间:2017-05-02 09:26:43      阅读:270      评论:0      收藏:0      [点我收藏+]
public class Solution {
    /**
     * @param A an integer array sorted in ascending order
     * @param target an integer
     * @return an integer
     */
    public int closestNumber(int[] A, int target) {
        // Write your code here
        if (A == null || A.length == 0) {
            return -1;
        }
        
        int start = 0;
        int end = A.length - 1;
        
        while(start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (A[mid] == target) {
                return mid;
            } else if (A[mid] < target) {
                start = mid;
            } else {
                end = mid;
            }
        }
        
        int startDis = Math.abs(A[start] - target);
        int endDis = Math.abs(A[end] - target);
        return startDis < endDis? start : end;
        
    }
}

O(logN)

Closest Number in Sorted Array

原文:http://www.cnblogs.com/codingEskimo/p/6794448.html

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