Create 81. Search in Rotated Sorted Array II

Author: stone16

81. Search in Rotated Sorted Array II

@@ -0,0 +1,12 @@
+public class Solution {
+    public boolean search(int[] nums, int target) {
+        // Brute force 有重复根本就不需要法二分法了，最差情况就是o(n)
+        for(int i = 0; i < nums.length; i++){
+            if(nums[i] == target){
+                return true;
+            }
+        }
+        return false;
+ 
+    }
+}