首页 > 代码库 > Remove Nth Node From End of List
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.
方法
使用两个指针进行标记。public ListNode removeNthFromEnd(ListNode head, int n) { ListNode p1 = head; ListNode p2 = head; for(int i = 0; i < n; i ++){ p2 = p2.next; } if(p2 == null){ head = head.next; }else{ while(p2.next != null){ p1 = p1.next; p2 = p2.next; } p1.next = p1.next.next; } return head; }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。