[LeetCode_19] Remove Nth Node From End of List_删除链表的倒数第N个节点

leetcode_19 题目描述： Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end,

>>阅读原文<<