题解 | #链表内指定区间反转#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @param m int整型 
     * @param n int整型 
     * @return ListNode类
     */
    ListNode* reverseBetween(ListNode* head, int m, int n) 
    {
        vector<int> data;
        while(head)
        {
            data.push_back(head->val);
            head = head->next;
        }
        int left = m - 1;
        int right = n - 1;
        while(left <= right)
        {
            int temp = data[left];
            data[left] = data[right];
            data[right] = temp;
            left++;
            right--;
        }
        ListNode* prev = new ListNode(0);
        ListNode* result = prev;
        for (int i = 0;i < data.size();++i)
        {
            ListNode* cur = new ListNode(data[i]);
            prev->next = cur;
            prev = cur;
        }
        return result->next;
    }
};

可以先遍历原来链表到vector中，反转vector中的东西，最后新建链表