LeetCode Top 100 Liked Questions 19. Remove Nth Node From End of List (Java版; Medium)
题目描述
Given a linked list, remove the n-th node from the end of list and return its head.
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.
Follow up:
Could you do this in one pass?
classSolution{public ListNode removeNthFromEnd(ListNode head,int n){
ListNode dummy =newListNode(-1);
dummy.next=head;
ListNode pre=dummy, cur=head, right=head;for(int i=0; i<n-1; i++){
right = right.next;}while(right.next!=null){
pre = cur;
cur = cur.next;
right = right.next;}
pre.next = cur.next;return dummy.next;}}
LeetCode Top 100 Liked Questions 19. Remove Nth Node From End of List (Java版; Medium)
welcome to my blogLeetCode Top 100 Liked Questions 19. Remove Nth Node From End of List (Java版; Medium)题目描述Given a linked list, remove the n-th node from the end of list and return its head.Examp...