首页 > 代码库 > 19. Remove Nth Node From End of List
19. 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.
很典型的2 pointer题目。先前进n, 然后当快的pointer到tail时候，慢的正好到要删除的前一个。
public ListNode RemoveNthFromEnd(ListNode head, int n) { ListNode slow = head; ListNode fast = head; ListNode sentinel = new ListNode(-1); sentinel.next = head; //first get the n distance between slow and fast, as it always valid, no need for valid check for(int i =0;i<n;i++) { fast = fast.next; } if(fast == null)//the first nood { sentinel.next = head.next; return sentinel.next; } while(fast.next != null) { slow = slow.next; fast = fast.next; } slow.next = slow.next.next; return head; }
19. Remove Nth Node From End of List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。