35. Search Insert Position

Author: coderbean

src/leetcode/_35_/Main.java

@@ -0,0 +1,15 @@
+package leetcode._35_;
+
+/**
+ * Created by zhangbo54 on 2019-03-04.
+ */
+public class Main {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.searchInsert(new int[]{1, 3, 5, 6}, 5));
+        System.out.println(solution.searchInsert(new int[]{1, 3, 5, 6}, 2));
+        System.out.println(solution.searchInsert(new int[]{1, 3, 5, 6}, 7));
+        System.out.println(solution.searchInsert(new int[]{1, 3, 5, 6}, 0));
+    }
+}
+

src/leetcode/_35_/Solution.java

@@ -0,0 +1,10 @@
+package leetcode._35_;
+
+import java.util.Arrays;
+
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        int index = Arrays.binarySearch(nums, target);
+        return index < 0 ? -index - 1 : index;
+    }
+}

src/leetcode/_35_/solution.md

@@ -0,0 +1,51 @@
+### [35\. Search Insert PositionCopy for MarkdownCopy for MarkdownCopy for MarkdownCopy for Markdown](https://leetcode.com/problems/search-insert-position/)
+
+Difficulty: **Easy**
+
+
+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.
+
+**Example 1:**
+
+```
+Input: [1,3,5,6], 5
+Output: 2
+```
+
+**Example 2:**
+
+```
+Input: [1,3,5,6], 2
+Output: 1
+```
+
+**Example 3:**
+
+```
+Input: [1,3,5,6], 7
+Output: 4
+```
+
+**Example 4:**
+
+```
+Input: [1,3,5,6], 0
+Output: 0
+```
+
+
+#### Solution
+
+Language: **Java**
+
+```java
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        int index = Arrays.binarySearch(nums, target);
+        return index < 0 ? -index - 1 : index;
+    }
+}
+```
+![](https://ws3.sinaimg.cn/large/006tKfTcgy1g13koxtxs3j31160ra0wl.jpg)