19. 删除链表的倒数第N个节点

简单记录

/**
 * 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) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        //一共有多少个结点
        ListNode* myNode = new ListNode;
        myNode = head;
        int NumOfList = 1;
        while(myNode->next != nullptr){
                myNode = myNode->next;
                NumOfList++;
        }
        // //边界判断，如果是1个数给进来
        // if(NumOfList == 1){
        //     return nullptr;
        // }
        //删除结点
        int forward_num = NumOfList +1 - n;
         myNode = head;
         //后面的1-2不能减，删除头结点直接返回下一个指针
        if(forward_num == 1){
            return myNode->next;
        }
        for(int i = 0;i<forward_num-2;i++){
            myNode = myNode->next;
        }
        myNode->next = myNode->next->next;
        return head;
    }
};