Time: 0 ms (100.00%), Space: 43.4 MB (59.39%) - LeetHub

Author: ahmeddhus

35-search-insert-position/35-search-insert-position.java

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