C# binary search


  • 0
    Y
        public class Solution {
            public int SearchInsert(int[] nums, int target) {
                int left=0,right=nums.Length-1;
                while(left<=right)
                {
                    int mid=left+(right-left)/2;
                    if(nums[mid]==target)
                        return mid;
                    if(nums[mid]>target)
                        right=mid-1;
                    else
                        left=mid+1;
                }
                return left;
            }
        }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.