Search Insert Position

Author: fishercoder1534

README.md

@@ -213,6 +213,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)|[Solution](../../blob/master/src/stevesun/algorithms/FirstMissingPositive.java)|O(n)|O(1)|Hard|
 |39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|[Solution](../../blob/master/src/stevesun/algorithms/CombinationSum.java)|O(k*n^k)|O(k)|Medium|Backtracking
 |38|[Count and Say](https://leetcode.com/problems/count-and-say/)|[Solution](../../blob/master/src/stevesun/algorithms/CountandSay.java)|O(n*2^n)|O(2^n)|Easy| Recursion, LinkedList
+|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[Solution](../../blob/master/src/stevesun/algorithms/SearchInsertPosition.java)|O(n)|O(1)|Medium|Array
 |34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[Solution](../../blob/master/src/stevesun/algorithms/SearchForARange.java)|O(logn)|O(1)|Medium|Array, Binary Search
 |33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[Solution](../../blob/master/src/stevesun/algorithms/SearchinRotatedSortedArray.java)|O(logn)|O(1)|Hard|Binary Search
 |32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)|[Solution](../../blob/master/src/stevesun/algorithms/LongestValidParentheses.java)|O(n)|O(n)|Hard|Stack, DP

src/stevesun/algorithms/SearchInsertPosition.java

@@ -0,0 +1,35 @@
+package stevesun.algorithms;
+
+/**
+ * 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
+ */
+public class SearchInsertPosition {
+
+    public int searchInsert(int[] A, int target) {
+        int len = A.length;
+        if (len == 0)
+            return 0;
+        else {
+            for (int i = 0; i < len; i++) {
+                if (A[0] > target)
+                    return 0;
+                else if (A[len - 1] < target)
+                    return len;
+                else if (A[i] == target)
+                    return i;
+                else if (A[i] < target && A[i + 1] > target)
+                    return i + 1;
+            }
+            return len;
+        }
+    }
+
+}