首页 > 代码库 > leetcode-Remove Nth Node From End of List
leetcode-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.
Hide Tags
Linked List Two PointersHave you met this question in a real interview?
/** * 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) { ListNode *p1,*p2; p1=head; p2=head; for(int i=1;i<=n;i++) p2=p2->next; if(p2==NULL) { p1=p1->next; return p1; } while(p2->next!=NULL) { p1=p1->next; p2=p2->next; } p1->next=p1->next->next; return head; } };
leetcode-Remove Nth Node From End of List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。