【LeetCode】#81搜索旋转排序数组 II(Search in Rotated Sorted Array II)

【LeetCode】#81搜索旋转排序数组 II(Search in Rotated Sorted Array II)

题目描述

假设按照升序排序的数组在预先未知的某个点上进行了旋转。
( 例如，数组 [0,0,1,2,2,5,6] 可能变为 [2,5,6,0,0,1,2] )。
编写一个函数来判断给定的目标值是否存在于数组中。若存在返回 true，否则返回 false。

示例

示例 1:

输入: nums = [2,5,6,0,0,1,2], target = 0
输出: true

示例 2:

输入: nums = [2,5,6,0,0,1,2], target = 3
输出: false

Description

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).
You are given a target value to search. If found in the array return true, otherwise return false.

Example

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

解法

class Solution {
    public boolean search(int[] nums, int target) {
        int f = 0, l = nums.length-1;
        while(f<=l){
            if(nums[f]==target || nums[l]==target)
                return true;
            f++;
            l--;
        }
        return false;
    }
}