Search in Rotated Sorted Array
来源:互联网 发布:韩国抄袭知乎 编辑:程序博客网 时间:2024/06/15 10:24
Search in Rotated Sorted Array
https://leetcode.com/problems/search-in-rotated-sorted-array/description/
public int search(int[] nums, int target) { int low = 0; int high = nums.length - 1; while(low <= high){ int mid = (low + high)/2; if(nums[mid] == target) return mid; //ex: 1, 3, 4, 5 , 7, 9 --> 7, 9, 1, 3, 4, 5 // 如果旋转后, 左边递增的元素的个数 < 右边递增的个数 else if(nums[low] > nums[mid]){ // 在这种if情况下,右半边都是递增的,如果target满足这些条件,就便于二分查找,所以选择右半边 if(target > nums[mid] && target < nums[low]) low = mid+1; 否则的话,就选择左半边 else high = mid; } // 1, 3, 4, 5, 7, 9 --> 4, 5, 7, 9, 1, 3 else{ if(target < nums[mid] && target >= nums[low]) high = mid; else low = mid + 1; } } // 总结:在这样的数组中,总能找到半部分是递增的,如果target能在这里面,就能进行正常的二分查找;否则的话就到另一半里面;另一半里面也总能找到半部分是递增的,...... 如此迭代下去,就能看到target是否存在或者它的index。 return -1; }
阅读全文
1 0
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- Search in Rotated Sorted Array
- 电商营销方式抢购,秒杀Redis原子减decr方法作为剩余库存判断条件的实现方式(1)
- servlet 的接口简单应用和filter过滤 用户未登录
- 电商营销方式抢购,秒杀Redis原子减decr方法作为剩余库存判断条件的实现方式(1)
- permutohedral lattice
- 二叉平衡树-AVL
- Search in Rotated Sorted Array
- 9月11日笔记(Servlet,Ajax,Filter)
- ubuntu修改环境变量
- RxJava源码解析04-变换过程(flatmap)
- JAVA实现数字反转
- 【go语言 安装第三方包】阿里云下go语言如何装第三方包?
- Weight Decay & Batch Normalization
- 【正一专栏】读邓力群自述(1915-1974)笔记(一)
- doGet,doPost,Filter