首页 > 代码库 > Leetcode-19 Remove Nth Node From End of List
Leetcode-19 Remove Nth Node From End of List
#19. Remove Nth Node From End of List
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.
题解:关键点在于把倒数第n位移除变成正数的来看,第一次遍历记录链表长度,第二次遍历到要删除的结点位置。
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { if(n==0) { return head; } int cnt=0; ListNode* p=head; ListNode* ret=head; while(p!=NULL) { cnt++; p=p->next; } int pos=cnt-n-1; if(pos<0) { return head->next; } while(pos>0) { head=head->next; pos--; } head->next=head->next->next; return ret; } };
Leetcode-19 Remove Nth Node From End of List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。