leetcode704

public class Solution
    {
        public int Search(int[] nums, int target)
        {
            var len = nums.Length;

            var low = 0;
            var high = len - 1;
            if (target == nums[low])
            {
                return low;
            }
            else if (target == nums[high])
            {
                return high;
            }
            while (low < high)
            {
                var mid = (low + high) / 2;
                var cur = nums[mid];

                if (target == cur)
                {
                    return mid;
                }
                else if (target < cur)
                {
                    high = mid - 1;
                }
                else
                {
                    low = mid + 1;
                }
            }
            return -1;
        }
    }

 

转载于:https://www.cnblogs.com/asenyang/p/9734652.html