[LeetCode]Search in Rotated Sorted Array

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