Leet Code 19 删除链表中倒数第n个节点 - Java
2016-06-08 00:00
507 查看
摘要: Leet Code 19 删除链表中倒数第n个节点 - Remove Nth Node From End of List - Java
问题原始链接 https://leetcode.com/problems/remove-nth-node-from-end-of-list
给定一个链表,删除倒数第n个节点,返回链表头。
例子:
给定链表 1->2->3->4->5,n=2。
删除倒数第2个节点后,链表变成 1->2->3->5。
注意:
给定的n总是有效。
试试看只扫描一遍链表。
问题原始链接 https://leetcode.com/problems/remove-nth-node-from-end-of-list
给定一个链表,删除倒数第n个节点,返回链表头。
例子:
给定链表 1->2->3->4->5,n=2。
删除倒数第2个节点后,链表变成 1->2->3->5。
注意:
给定的n总是有效。
试试看只扫描一遍链表。
[code=language-java]/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public static ListNode removeNthFromEnd(ListNode head, int n) { ListNode s = head; ListNode p = head; ListNode q = head; while (s != null) { s = s.next; if (n <= 0) { q = q.next; if (n == 0) { n--; } else if (n < 0) { p = p.next; } } else { n--; } } if (q == head) { q = head.next; head.next = null; return q; } else { p.next = q.next; q.next = null; 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 题解