shaopu Song
shaopu Song
自己的解法， C++ ```c++ ListNode* reverseKGroup(ListNode* head, int k) { // base case, don't need to reverse if (head == nullptr || head->next == nullptr) return head; // successor stores the...
感觉翻转二叉树直接这么写更简洁一些： ```c++ TreeNode* invertTree(TreeNode* root) { // base case if (root == nullptr) return nullptr; // recursive // since we only change pointer direction ,when saving root->left, we mean saving...
## C++版本 ```c++ ListNode* reverseBetween(ListNode* head, int left, int right) { // base case: if (left == 1) return reverseK(head, right); // recursive ListNode* reverseHead = reverseBetween(head->next, left - 1,...