leetcode写题笔记 -- 删除链表的倒数第N个结点

/*
19. 删除链表的倒数第N个结点

给你一个链表，删除链表的倒数第 n 个结点，并且返回链表的头结点。

提示：
链表中结点的数目为 sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz

进阶：你能尝试使用一趟扫描实现吗？
*/

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */

#include<iostream>
using namespace std;
struct ListNode {
   int val;
   ListNode* next;
   ListNode() : val(0), next(nullptr) {}
   ListNode(int x) : val(x), next(nullptr) {}
   ListNode(int x, ListNode* next) : val(x), next(next) {}
};
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode* tmpTail = head;
        ListNode* curr = head;
        for (int i = 0; i < n; i++) {
            tmpTail = tmpTail->next;
        }
        if (tmpTail == nullptr) return head->next;
        while (tmpTail != nullptr && tmpTail->next != nullptr) {
            curr = curr->next;
            tmpTail = tmpTail->next;
        }
        if (curr != nullptr && curr->next != nullptr) curr->next = curr->next->next;
        else if (n == 1) head = nullptr;
        return head;
    }
};

void main(void) {
    
    ListNode node2(2);
    ListNode node1(1,(ListNode*)&node2);

    Solution sol;
    ListNode* result = sol.removeNthFromEnd((ListNode*)&node1,2);
    while (result != nullptr) {
        cout << result->val << endl;
        result = result->next;
    }
}

// 4 ms + 10.3 MB