educoder头歌Java查找算法之折半查找：搜索数组

package step3;

public class Task {
	
	public int search(int n, int[] nums, int T) {
        /********* Begin *********/
        if (nums == null || nums.length == 0) {
            return -1;
        }

        int left = 0, right = n - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (nums[mid] == T) {
                return mid;
            }

            // 判断左半段是否有序
            if (nums[left] <= nums[mid]) {
                // 判断目标值是否在左半段中
                if (nums[left] <= T && T < nums[mid]) {
                    right = mid - 1;
                } else {
                    left = mid + 1;
                }
            } else {
                // 右半段有序
                // 判断目标值是否在右半段中
                if (nums[mid] < T && T <= nums[right]) {
                    left = mid + 1;
                } else {
                    right = mid - 1;
                }
            }
        }

        return -1;
        /********* End *********/
    }
}