Added Leetcode Problem-35

pavandeveloperr · pavandeveloperr · commit 85a575fc11c5 · 2022-10-13T18:23:30.000+05:30
diff --git a/LeetCode_Java_Solutions/Search-insert-Position.java b/LeetCode_Java_Solutions/Search-insert-Position.java
@@ -0,0 +1,22 @@
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        int low = 0;
+        int high = nums.length - 1;
+        
+        while(low <= high) {
+            int mid = low + (high - low) / 2;
+            
+            if(nums[mid] == target){
+                return mid;
+            } else if (nums[mid] > target) {
+                high = mid - 1;
+                
+            } else {
+                low = mid + 1;
+            }
+        
+        }
+        
+        return low;
+    }
+}
