Add solution #704

Author: JoshCrozier

Diff for: README.md

@@ -125,6 +125,7 @@
 686|[Repeated String Match](./0686-repeated-string-match.js)|Easy|
 700|[Search in a Binary Search Tree](./0700-search-in-a-binary-search-tree.js)|Easy|
 701|[Insert into a Binary Search Tree](./0701-insert-into-a-binary-search-tree.js)|Medium|
+704|[Binary Search](./0704-binary-search.js)|Easy|
 713|[Subarray Product Less Than K](./0713-subarray-product-less-than-k.js)|Medium|
 722|[Remove Comments](./0722-remove-comments.js)|Medium|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|

Diff for: solutions/0704-binary-search.js

@@ -0,0 +1,30 @@
+/**
+ * 704. Binary Search
+ * https://leetcode.com/problems/binary-search/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums which is sorted in ascending order, and an
+ * integer target, write a function to search target in nums. If target exists,
+ * then return its index. Otherwise, return -1.
+ *
+ * You must write an algorithm with O(log n) runtime complexity.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var search = function(nums, target) {
+  let left = 0;
+  let right = nums.length - 1;
+
+  while (left <= right) {
+    const pivot = Math.floor((right + left) / 2);
+    if (nums[pivot] === target) return pivot;
+    if (target < nums[pivot]) right = pivot - 1;
+    else left = pivot + 1;
+  }
+
+  return -1;
+};