add solution of problem 35: search insert position

Author: ppulse

SearchInsertPosition35/README.md

@@ -0,0 +1,9 @@
+Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
+
+You may assume no duplicates in the array.
+
+Here are few examples.
+`[1,3,5,6]`, 5 → 2
+`[1,3,5,6]`, 2 → 1
+`[1,3,5,6]`, 7 → 4
+`[1,3,5,6]`, 0 → 0

SearchInsertPosition35/Solution.java

@@ -0,0 +1,21 @@
+public class Solution {
+    public int searchInsert(int[] nums, int target) {
+        if (nums == null || nums.length == 0)
+            return 0;
+        
+        int left = 0;
+        int right = nums.length - 1;
+        
+        while (left <= right) {
+            int mid = (left + right) >> 1;
+            if (nums[mid] > target)
+                right = mid - 1;
+            else if (nums[mid] < target)
+                left = mid + 1;
+            else
+                return mid;
+        }
+        
+        return left;
+    }
+}