Runtime: 0 ms (Top 100.0%) | Memory: 42.90 MB (Top 78.78%)

Author: AnasImloul

scripts/algorithms/S/Search Insert Position/Search Insert Position.java

@@ -1,20 +1,17 @@
+// Runtime: 0 ms (Top 100.0%) | Memory: 42.90 MB (Top 78.78%)
+
 class Solution {
     public int searchInsert(int[] nums, int target) {
-        int start=0;
-        int end=nums.length-1;
-        int ans=0;
-        while(start<=end){
-            int mid=start+(end-start)/2;
-            if(target<nums[mid]){
-                end=mid-1;
-            }
-            if(target>nums[mid]){
-                start=mid+1;
-            }
-            if(target==nums[mid]){
-                return mid;
-            }
+        int start = 0;
+        int end = nums.length-1;
+
+        while (start <= end) {
+            int mid = start + (end-start)/2;
+            if (nums[mid] == target) return mid;
+            else if (nums[mid] > target) end = mid-1;
+            else start = mid+1;
         }
-        return start; 
+
+        return start;
     }
 }