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;
        }
    }

 

Java版本代码：

class Solution {
    public int search(int[] nums, int target) {
        int n = nums.length;
        int low = 0;
        int high = n - 1;
        while(low <= high){
            int mid = (low + high) / 2;
            int cur = nums[mid];
            if(cur == target){
                return mid;
            }else if(cur < target){
                low = mid + 1;
            }else{
                high = mid - 1;
            }
        }
        return -1;
    }
}