题解 | #链表内指定区间反转#
链表内指定区间反转
https://www.nowcoder.com/practice/b58434e200a648c589ca2063f1faf58c
/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ #include <vector> 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* next_node = head; int node_count = 1; std::vector<int> elements; while (next_node != nullptr) { if (node_count >= m && node_count <= n) { elements.push_back(next_node->val); } node_count++; next_node = next_node->next; } next_node = head; node_count = 1; while (next_node != nullptr) { if (node_count >= m && node_count <= n) { next_node->val = elements.back(); elements.pop_back(); } node_count++; next_node = next_node->next; } return head; } };
遍历两次,使用栈存储。空间复杂度不满足要求。
#我的实习求职记录#