public int search(int[] nums, int target) {
if (nums == null || nums.length == 0) {
int start = 0, end = nums.length - 1, mid = 0;
while (start + 1 < end) {
mid = start + (end - start) / 2;
if (nums[mid] == target) {
else if (nums[mid] < nums[end]) {
if (nums[mid] < target && target <= nums[end]) {
if (nums[start] <= target && target < nums[mid]) {
if (nums[start] == target) {
else if (nums[end] == target) {