Given a linked list, remove the n-th node from the end of list and return its head.
Example:
1 2 3
| 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.
|
Note:
Given n will always be valid.
来自LeetCode上的一道链表操作题,题目意思是删除链表的倒数第n个元素,由于数据保证n是合法的,所以只需要考虑两个边界情况:1.删除的是首节点 2.删除的是尾节点(其实这个情况不用考虑2019.8.11)
接下来附上AC代码:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
|
class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { int len = 0; for (auto it = head; it != NULL; it = it->next) len++; int moveSteps = len - n - 1; if (moveSteps == -1) { return head->next; } ListNode* p = head; for (int i = 0; i < moveSteps; i++) { p = p->next; } p ->next = p->next->next; return head; } };
|