首页 > 代码库 > 19. Remove Nth Node From End of List(C++)
19. Remove Nth Node From End of List(C++)
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.
Solution :
1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNode *next; 6 * ListNode(int x) : val(x), next(NULL) {} 7 * }; 8 */ 9 class Solution { 10 public: 11 ListNode* removeNthFromEnd(ListNode* head, int n) { 12 ListNode myhead(0); 13 myhead.next=head; 14 ListNode *p=&myhead,*q=&myhead; 15 for(int i=0;i<n;i++) p=p->next; 16 while(p->next!=NULL){ 17 p=p->next; 18 q=q->next; 19 } 20 q->next=q->next->next; 21 return myhead.next; 22 } 23 };
19. Remove Nth Node From End of List(C++)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。