L2：05 - Search in Rotated Sorted Array II

https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/

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.

Linear algorithm, go for-loop!

/** * Copyright: NineChapter * - Algorithm Course, Mock Interview, Interview Questions * - More details on: http://www.ninechapter.com/ */// it ends up the same as sequential search// We used linear search for this question just to indicate that the // time complexity of this question is O(n) regardless of binary search is applied or not.public class Solution {    public boolean search(int[] A, int target) {        for (int i = 0; i < A.length; i ++) {            if (A[i] == target) {                return true;            }        }        return false;    }}