binary-search (examplehub#86)

realDuYuanChao · github-actions · web-flow · commit 79387a577ec3 · 2021-03-25T20:16:32.000+08:00
* binary-search

* Formatted with Google Java Formatter

Co-authored-by: github-actions &lt;${GITHUB_ACTOR}@users.noreply.github.com&gt;
diff --git a/src/main/java/com/examplehub/leetcode/easy/BinarySearch.java b/src/main/java/com/examplehub/leetcode/easy/BinarySearch.java
@@ -0,0 +1,16 @@
+package com.examplehub.leetcode.easy;
+
+import com.examplehub.searches.BinarySearchRecursion;
+
+/** https://leetcode.com/problems/binary-search/ */
+public class BinarySearch {
+  public static int solution1(int[] nums, int target) {
+    com.examplehub.searches.BinarySearch binarySearch = new com.examplehub.searches.BinarySearch();
+    return binarySearch.search(nums, target);
+  }
+
+  public static int solution2(int nums[], int target) {
+    BinarySearchRecursion binarySearchRecursion = new BinarySearchRecursion();
+    return binarySearchRecursion.search(nums, target);
+  }
+}
diff --git a/src/test/java/com/examplehub/leetcode/easy/BinarySearchTest.java b/src/test/java/com/examplehub/leetcode/easy/BinarySearchTest.java
@@ -0,0 +1,19 @@
+package com.examplehub.leetcode.easy;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class BinarySearchTest {
+  @Test
+  void testSolution1() {
+    assertEquals(4, BinarySearch.solution1(new int[] {-1, 0, 3, 5, 9, 12}, 9));
+    assertEquals(-1, BinarySearch.solution1(new int[] {-1, 0, 3, 5, 9, 12}, 2));
+  }
+
+  @Test
+  void testSolution2() {
+    assertEquals(4, BinarySearch.solution2(new int[] {-1, 0, 3, 5, 9, 12}, 9));
+    assertEquals(-1, BinarySearch.solution2(new int[] {-1, 0, 3, 5, 9, 12}, 2));
+  }
+}
