Categorygithub.com/frankegoesdown/leetcode-in-goAlgorithms0081.search-in-rotated-sorted-array-ii
package
0.0.0-20190725034537-db5e768ce8c3
Repository: https://github.com/frankegoesdown/leetcode-in-go.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
0
Dependents
0
Files
27 SLOC

# README

81. Search in Rotated Sorted Array II

题目

Follow up for "Search in Rotated Sorted Array":

  1. What if duplicates are allowed?
  2. Would this affect the run-time complexity? How and why?

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).

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

The array may contain duplicates.

解题思路

和33. Search in Rotated Sorted Array的解题思路一样，只是要先自己找到 k 的值。

见程序注释