19. Remove Nth Node From End of List
来源:互联网 发布:中银淘宝信用卡查询 编辑:程序博客网 时间:2024/06/10 15:13
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.
官方答案如下:
Algorithm
The above algorithm could be optimized to one pass. Instead of one pointer, we could use two pointers. The first pointer advances the list byn+1n+1n+1 steps from the beginning, while the second pointer starts from the beginning of the list. Now, both pointers are exactly separated bynnn nodes apart. We maintain this constant gap by advancing both pointers together until the first pointer arrives past the last node. The second pointer will be pointing at thennnth node counting from the last.We relink the next pointer of the node referenced by the second pointer to point to the node's next next node.
Figure 2. Remove the nth element from end of a list.
Java
public ListNode removeNthFromEnd(ListNode head, int n) { ListNode dummy = new ListNode(0); dummy.next = head; ListNode first = dummy; ListNode second = dummy; // Advances first pointer so that the gap between first and second is n nodes apart for (int i = 1; i <= n + 1; i++) { first = first.next; } // Move first to the end, maintaining the gap while (first != null) { first = first.next; second = second.next; } second.next = second.next.next; return dummy.next;}
Complexity Analysis
Time complexity : O(L)O(L)O(L). The algorithm makes one traversal of the list of LLL nodes. Therefore time complexity is O(L)O(L)O(L).
Space complexity : O(1)O(1)O(1).We only used constant extra space.
Analysis written by: @elmirap.
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node from End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- Remove Nth Node From End of List
- 读取GRE AWA Sim的paw文件
- Java基础类型与包装类
- android多线程-AsyncTask之工作原理深入解析(上)
- LeetCode 122. Best Time to Buy and Sell Stock II (Easy)
- C语言复习-01
- 19. Remove Nth Node From End of List
- 头插法创建单链表代码实现
- 字符串
- 万年历的编写
- android多线程-AsyncTask之工作原理深入解析(下)
- C++中类的对象和指针的区别理解
- 关于Spring Jackson 反序列化Date时遇到的问题
- C语言——字符串指针-strcmp
- HDU6215 Brute Force Sorting 【模拟】