leetcode 19. Remove Nth Node From End of List
2016-06-20 12:53
531 查看
其实三个指针可以简化称为两个，要删除的元素不需要指针，只需要记录其后面元素的指针，最后到达应该删除的位置之后:
back -> next = back->next->next;
back -> next = back->next->next;
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode * front = head, * rem = head, * back = head;
int m = n-1;
while(m--){
front = front -> next;
}
if(front->next==NULL){
return head->next;
}
front = front->next;
rem = rem->next;
while(front->next!=NULL){
front = front->next;
rem = rem->next;
back = back->next;
}
back ->next = rem->next;
return head;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解