add test for 81

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_81.java

@@ -3,11 +3,24 @@
 /**
  * 81. Search in Rotated Sorted Array II
  *
- * Follow up for "Search in Rotated Sorted Array":
+ * Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
  *
- * What if duplicates are allowed?
+ * (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 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
+ * Follow up:
+ *
+ * This is a follow up problem to Search in Rotated Sorted Array, where nums may contain duplicates.
  * Would this affect the run-time complexity? How and why?
- * Write a function to determine if a given target is in the array.
  */
 public class _81 {
 

src/test/java/com/fishercoder/_81Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._81;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _81Test {
+    private static _81.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _81.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, (solution1.search(new int[]{2, 5, 6, 0, 0, 1, 2}, 0)));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(false, (solution1.search(new int[]{2, 5, 6, 0, 0, 1, 2}, 3)));
+    }
+
+}