add Easy_35_Search_Insert_Position

Author: zongyanqi

Easy_35_Search_Insert_Position.js

@@ -0,0 +1,41 @@
+/**
+ * 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
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var searchInsert = function (nums, target) {
+
+    var index = 0;
+    for (var i = 0; i < nums.length; i++) {
+        var temp = nums[i];
+        if (target === temp) {
+            return i;
+        }
+        else if (target > temp) {
+            index++;
+        } else {
+            return index;
+        }
+    }
+    return index;
+
+};
+
+console.log(searchInsert([1, 3, 5, 6], 5) == 2);
+console.log(searchInsert([1, 3, 5, 6], 2) == 1);
+console.log(searchInsert([1, 3, 5, 6], 7) == 4);
+console.log(searchInsert([1, 3, 5, 6], 0) == 0);
+console.log(searchInsert([1, 3, 5, 6], 100) == 4);