search_Insert_position.java

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