Remove Nth Node From End of List 删除链表倒数第N个节点
2015-03-26 13:03
579 查看
Remove Nth Node From End of List
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.
Note:
Given n will always be valid.
Try to do this in one pass.
/** * 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) { if(head==NULL) return NULL; ListNode *p=head,*q=head; int z=n; while(z--) { p=p->next; } if(p==NULL) { return head->next; } while(p->next) { q=q->next; p=p->next; } q->next=q->next->next; return head; } };
相关文章推荐
- 【LeetCode】Remove Nth Node From End of List 删除链表中倒数第n个节点- Easy +
- LintCode Remove Nth Node From End of List 删除链表中倒数第n个节点
- 174. 删除链表中倒数第n个节点 (remove-nth-node-from-end-of-list)(c++)----lintcode面试题之链表
- [LeetCode]—Remove Nth Node From End of List 删除链表的倒数第n个节点
- [LeetCode-19] Remove Nth Node From End of List(删除链表中倒数第N个节点)
- [LeetCode] 19. Remove Nth Node From End of List 删除链表的倒数第N个节点 @python
- 【LeetCode题解】19_删除链表的倒数第N个节点(Remove-Nth-Node-From-End-of-List)
- #19 Remove Nth Node From End of List(删除链表倒数第N个节点)
- [C++]LeetCode 19: Remove Nth Node From End of List(删除链表中倒数第n个节点)
- leetcode-19. Remove Nth Node From End of List(删除链表倒数第N个节点)
- LeetCode(Remove Nth Node From End of List)删除链表倒数第n个节点
- leetcode:Remove Nth Node From End of List(删除链表倒数第n个节点)【面试算法题】
- [LeetCode] Remove Nth Node From End of List 移除链表倒数第N个节点
- 19. Remove Nth Node From End of List(移除链表的倒数第n个节点)
- Remove Nth Node From End of List(从链表表尾删除第n个节点)
- leetcode 3. 移除链表的倒数第n个节点 Remove Nth Node From End of List
- 删除链表的倒数第n个结点 Remove Nth Node From End of List
- Remove Nth Node From End of List 链表删除倒数第N个元素@LeetCode
- 【Leetcode】19. Remove Nth Node From End of List - 删掉链表倒数第n个节点
- lintcode 容易题:Remove Nth Node From End of Lis 删除链表中倒数第n个节点