leetcode:Remove Nth Node From End of List [19]

Given a linked list, remove the nth node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

/**
 * 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* b = head;
		ListNode* c = head;
		while (n--) {
			b = b->next;
		}
		if (b == NULL) return head->next;
		while (b ->next!= NULL) {
			b = b->next;
			c = c->next;
		}
		c->next = c->next->next;
		return head;
	}
	
};