Added task 35.

Author: javadev

src/main/java/s0035_search_insert_position/Solution.java

@@ -0,0 +1,19 @@
+package s0035_search_insert_position;
+
+public class Solution {
+    public int searchInsert(int[] nums, int target) {
+        int lo = 0;
+        int hi = nums.length - 1;
+        while (lo <= hi) {
+            int mid = lo + (hi - lo) / 2;
+            if (target == nums[mid]) {
+                return mid;
+            } else if (target < nums[mid]) {
+                hi = mid - 1;
+            } else if (target > nums[mid]) {
+                lo = mid + 1;
+            }
+        }
+        return lo;
+    }
+}

src/test/java/s0035_search_insert_position/SolutionTest.java

@@ -0,0 +1,13 @@
+package s0035_search_insert_position;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.Test;
+
+public class SolutionTest {
+    @Test
+    public void searchInsert() {
+        assertThat(new Solution().searchInsert(new int[] {1, 3, 5, 6}, 5), equalTo(2));
+    }
+}