牛客刷题系列之进阶版（搜索旋转排序数组，链表内指定区间反转）

class Solution {
public:
    int search(vector<int>&amp; nums, int target) {
        int left=0;
        int right =nums.size()-1;
        int mid;
        while(left<=right)
        {
            mid = (left+right)/2;

            if(nums[0]>target)//当t在右边的数组时
            {
                if(nums[mid]>=nums[0]) //当mid左边时，需要将left=mid+1
                nums[mid] = -10001;
            }
            else//当t在左边的数组时
            {
                if(nums[mid] < nums[0]) //当mid右边时，需要将right = mid-1;
                 nums[mid] = 10001;
            }

            if(nums[mid] > target)
               right = mid-1;
            else if(nums[mid] <target)
              left = mid+1;
              else
              return mid;
        }
         return -1;
    }
};

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param head ListNode类 
     * @param m int整型 
     * @param n int整型 
     * @return ListNode类
     */
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        // write code here
        ListNode* res =new ListNode(0);
        ListNode* cur = head;
        ListNode* pre = res;
        res->next= head;
        for(int i=1;i<m;i++)
        {
            pre =cur;
            cur =cur->next;
        }
        for(int i=m;i<n;i++)
        {
           ListNode* tem =cur->next;
            cur->next = tem->next;
            tem->next  =   pre->next;
            pre->next = tem;
        }
        return res->next;;
    }
};