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

Search in Rotated Sorted Array

时间:2015-04-13 09:27:59      阅读:104      评论:0      收藏:0      [点我收藏+]

标签:

public class Solution {
    public int search(int[] A, int target) {
        if(A==null || A.length==0)
            return -1;
        int l = 0;
        int r = A.length-1;
        while(l<=r)
        {
            int m = (l+r)/2;
            if(target == A[m])
                return m;
            if(A[m]<A[r])
            {
                if(target>A[m] && target<=A[r])
                    l = m+1;
                else
                    r = m-1;
            }
            else
            {
                if(target>=A[l] && target<A[m])
                    r = m-1;
                else
                    l = m+1;                    
            }
        }
        return -1;
    }
}

 

Search in Rotated Sorted Array

标签:

原文地址:http://www.cnblogs.com/jiajiaxingxing/p/4421298.html

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