81. Search in Rotated Sorted Array II

Search in Rotated Sorted Array II.md

There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).

Before being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,4,4,5,6,6,7] might be rotated at pivot index 5 and become [4,5,6,6,7,0,1,2,4,4].

Given the array nums after the rotation and an integer target, return true if target is in nums, or false if it is not in nums.

You must decrease the overall operation steps as much as possible.

Example 1:

Input: nums = [2,5,6,0,0,1,2], target = 0 Output: true Example 2:

Input: nums = [2,5,6,0,0,1,2], target = 3 Output: false

Constraints:

1 <= nums.length <= 5000 -104 <= nums[i] <= 104 nums is guaranteed to be rotated at some pivot. -104 <= target <= 104

Follow up: This problem is similar to Search in Rotated Sorted Array, but nums may contain duplicates. Would this affect the runtime complexity? How and why?

Leetcode 81. Search in Rotated Sorted Array II

search.go

func search(nums []int, target int) bool {
   start_index := 0
	end_index := len(nums) - 1
	for start_index <= end_index {
		mid_index := (int)(start_index + (end_index-start_index)/2)
		if nums[mid_index] == target {
			return true
		}

		if nums[mid_index] == nums[start_index] && nums[mid_index] == nums[end_index] {
			start_index++
			end_index--
		} else if nums[start_index] <= nums[mid_index] {
			if target >= nums[start_index] && target <= nums[mid_index] {
				end_index = mid_index - 1
			} else {
				start_index = mid_index + 1
			}
		} else {
			if target <= nums[end_index] && target >= nums[mid_index] {
				start_index = mid_index + 1
			} else {
				end_index = mid_index - 1
			}
		}

	}
	return false
}

search.java

class Solution {
    public boolean search(int[] nums, int target) {
       int start = 0, end = nums.length - 1;
      while(start <= end) {
          int mid = start + (end - start) / 2;
          if(nums[mid] == target) return true;
         
          if(nums[start] == nums[mid] && nums[mid] == nums[end]) {
                start ++;
                end --;
            }
          else if(nums[start] <= nums[mid]) {
              if(target >= nums[start] && target <= nums[mid])
              end = mid - 1;

              else
              start = mid + 1;
          }
          else {
              if(target <= nums[end] && target >= nums[mid])
              start = mid + 1;

              else
              end = mid - 1; 
          }
      }
      return false;
    }
}