原题
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.
代码实现
/**
* Definition for singly-linked list.
* public class ListNode {
* public int val;
* public ListNode next;
* public ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode RemoveNthFromEnd(ListNode head, int n) {
ListNode tmp = head;
int sn=0;//node count;
while(tmp!=null){
tmp=tmp.next;
sn++;
}
//tmp points to head again
tmp=head;
int psn=sn-n,i=1;
//after jumping loof,
//tmp points to previous node that would be deleted
while(i++<psn){
tmp=tmp.next;
}
if(psn==0) head = tmp.next; //solving previous node not existence
else if(n==1) tmp.next=null; //deleting last node;
else tmp.next=tmp.next.next;
return head;
}
}
题库
Leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp