LeetCode - Search in Rotated Sorted Array II

weixin_34043301

于 2015-12-06 10:23:00 发布

阅读量51

点赞数

文章标签：数据结构与算法

本文深入探讨了在允许重复元素的情况下，搜索旋转排序数组的问题。通过分析和实现一种遍历查找的解决方案，阐述了其运行时复杂度的变化，并提供了实际代码示例。

题目：

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.

思路：

直接循环一遍查找

package array;

public class SearchInRotatedSortedArrayII {

    public boolean search(int[] nums, int target) {
        int len;
        if (nums == null || (len = nums.length) == 0) return false;
        for (int i = 0; i < len; ++i) 
            if (nums[i]==target)
                return true;
        return false;
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] nums = { 3, 1, 1 };
        SearchInRotatedSortedArrayII s = new SearchInRotatedSortedArrayII();
        System.out.println(s.search(nums, 3));
    }

}