search in rotated sorted array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

public class Solution {
    public int search(int[] nums, int target) {
        if(nums.length == 0 || nums == null){
            return -1;
        }
        int s = 0;
        int e = nums.length -1;
        int m = 0;
        while(s+1<e){
            m = s + (e-s)/2;
            if(nums[m] == target){
                return m;
            }else if(nums[s]<nums[m]){//左边全升序
                if(nums[s]<=target&&target<=nums[m]){//t在s,m之间
                    e = m;//缩小范围
                }else{
                    s = m;//去右边找
                }
            }else{//左边有转折点
                if(nums[m]<=target&&target<=nums[e]){//t在m,e之间
                    s = m;//缩小范围
                }else{
                    e = m;//去左边找
                }
            }
        }
        if(nums[s] == target){
            return s;
        }
        if(nums[e] == target){
            return e;
        }
        return -1;
    }
}