二分查找例题

二分查找-leetcode34

  public static int[] SearchNumber(int[] nums, int target)
        {
            var left = 0;//左边界
            var right = nums.Length - 1;//有边界
            var arry = new int[] {-1,-1 };//找不到目标值返回的数组
            while (left<=right)//区间定义 为闭区间[]
            {
                int middle = (left+right)/2;//中间值
                if (middle>nums.Length)//中间值大于数组长度 直接返回默认数组
                {
                    return arry;
                }
                if (nums[middle] == target)//中间值等于目标值 遍历当前数组第i个元素
                {
                    for (int i = 0; i < nums.Length; i++)
                    {
                        if (nums[i]==target)//如果当前数等与target 就取此下标给数组
                        {
                            arry[1] = i;
                        }
                    }
                    for (int i = middle; i >= 0; i--)//减少循环次数 添加数组元素
                    {
                        if (nums[i] == target)
                        {
                            arry[0] = i;
                        }
                    }
                    return arry;
                }
                // 区间判断
                else if (nums[middle]<target)
                {
                    left = middle + 1;
                }else if (nums[middle] > target)
                {
                    right = middle - 1;
                }
            }
            return arry;
        }