LeetCode Solutions/Binary Search Study Plan/Binary Search II/Search in Rotated Sorted Array II.java
<reponame>DevashishPathrabe/LeetCode<filename>LeetCode Solutions/Binary Search Study Plan/Binary Search II/Search in Rotated Sorted Array II.javaclass Solution {
    public boolean search(int[] nums, int target) {
        for(int i=0; i<nums.length; i++){
            if(nums[i] == target){
                return true;
            }
        }
        return false;
    }
}