• Search in Rotated Sorted Array


    Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

    (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

    You are given a target value to search. If found in the array return its index, otherwise return -1.

    You may assume no duplicate exists in the array.

        public int search(int[] nums, int target) {
            int j = nums.length-1;
            int i = 0;
            while (i<=j){
                int middle = (i+j)/2;
                if (nums[middle]==target){
                    return middle;
                }
                else if (nums[middle]>=nums[i]){
                    if (nums[middle]>target&&target>=nums[i]){
                        j = middle-1;
                    }
                    else{
                        i = middle+1;
                    }
                }
                else {
                    if (nums[middle]<target&&target<=nums[j]){
                        i = middle +1;
                    }
                    else {
                        j = middle -1;
                    }
                }
            }
            return -1;
        }
    
  • 相关阅读:
    2019年计划书单
    redis 分布式锁实现
    filter-grok,dissect匹配数据
    nohup-长期运行进程
    filter
    kill
    watch
    free
    jar
    tree
  • 原文地址:https://www.cnblogs.com/bingo2-here/p/8207039.html
Copyright © 2020-2023  润新知