Search in Rotated Sorted Array II

旋转有序数组搜索

最新推荐文章于 2021-10-14 20:56:08 发布

转载最新推荐文章于 2021-10-14 20:56:08 发布 · 60 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/krunning/p/3538771.html

本文介绍了一个针对含有重复元素的旋转有序数组的搜索算法。通过实现一个公共类Solution，并定义search方法来查找目标值是否存在数组中。该算法考虑了数组旋转且可能包含重复元素的情况，通过不断调整搜索范围直至找到目标值或确认不存在。

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

 1 public class Solution {
 2     //rotated array all is <= 
 3     public boolean search(int[] A, int target) {
 4         if(A.length<=0){return false;}
 5         int start = 0, end = A.length-1;
 6         while(start<=end){
 7             int mid = (start+end)/2;
 8             if(A[mid]==target) return true;
 9             if(A[mid]>A[start]){
10                 if(target>=A[start] && target<=A[mid]){
11                     end = mid-1;
12                 }
13                 else{
14                     start = mid+1;
15                 }
16             }
17             else if(A[mid]<A[start]){
18                 if(target>=A[mid] && target<=A[end]){
19                     start = mid+1;
20                 }
21                 else{
22                     end = mid-1;
23                 }
24             }
25             else{
26                 start ++;
27             }
28         }
29         return false;
30     }
31 }