19.Remove Nth Node From End of List（移除单链表中倒数第N个结点）
2015-08-03 14:37
615 查看
Given a linked list, remove the nth node
from the end of list and return its head.
For example,
public class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode res = head;
int len = 0;
ListNode ahead = head;
while(ahead!=null){
len++;
ahead = ahead.next ;
}
if(n>len) return null;
if(len==n){
return head.next;
}
for(int i = 1;i<len-n;i++){
head = head.next;
}
head.next = head.next.next;
return res;
}
}
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.
public class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode res = head;
int len = 0;
ListNode ahead = head;
while(ahead!=null){
len++;
ahead = ahead.next ;
}
if(n>len) return null;
if(len==n){
return head.next;
}
for(int i = 1;i<len-n;i++){
head = head.next;
}
head.next = head.next.next;
return res;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Node.js学习入门手册
- Count Complete Tree Nodes***
- [LeetCode] Count Complete Tree Nodes
- Windows下Node.js开发入门(1)
- node-zk-browser环境搭建
- [leetcode] 222.Count Complete Tree Nodes
- Leetcode #222 Count Complete Tree Nodes
- Leetcode Delete Node in a Linked List
- node.js addons development Prerequisite knowledgement/node.js插件开发预备知识
- Reverse Nodes in k-Group
- Reverse Nodes in k-Group
- 理解inode
- Swap Nodes in Pairs
- [LeetCode] Reverse Nodes in k-Group
- [置顶] Node.js自动化测试及大规模性能测试技术实现（Java&Node.JS）
- Node.js自动化技术实现（Java）
- LeetCode#24 Swap Nodes in Pairs
- leetcode--Count Complete Tree Nodes
- Node.js初体验之入门（二）
- Node.js初体验之入门（一）