1
 * Definition for singly-linked list.
2
 * struct ListNode {
3
   *int val;
4
   *ListNode *next;
5
   *ListNode()
6
       : val(0),
7
   next(nullptr){} * ListNode(int x)
8
       : val(x),
9
   next(nullptr){} * ListNode(int x, ListNode *next) : val(x), next(next){} *
10
 };
11
 */ class Solution {
12
  public:
13
   ListNode *removeNthFromEnd(ListNode *head, int n) {
14
     ListNode *n1 = new ListNode();
15
     ListNode *temp = head;
16
     ListNode *p = head;
17
     ListNode *q = n1;
18
     n1->next = head;
19
     int count;
20
     while (temp) {
21
       if (n > 0) {
22
         n--;
23
       } else if (n == 0) {
24
         cout < val;
25
         p = p->next;
26
         q = q->next;
27
       }
28
       temp = temp->next;
29
     }
30
     q->next = p->next;
31
     delete p;
32
     return n1->next;
33
   }
34
 };