LeetCode - 19

题目链接：https://leetcode.com/problems/remove-nth-node-from-end-of-list/
题目大意：给定一个链表和一个整数n。删除从链表末尾往前数的第n个数。

需要注意的地方就是删除头节点和尾节点。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *p = head;
        ListNode *ans = head;
        int len = 0;
        while(p){
            len++;
            p = p -> next;
        }
        int index = len - n;
        if(index == 0){ 
            head = ans -> next;
        }
        int temp = 1;
        while(ans){
            if(temp == index && n != 1){
                ans -> next = ans -> next -> next;
            }else if(temp == index && n == 1){ 
                ans -> next = NULL;
            }
            ans = ans -> next;
            temp++;
        }
        return head;
    }
};