标签:Node head dummyHead End fast next Nth slow ListNode
题目描述:
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.
好久没做题,少了股锐气。这题思路才是关键。
solution:
ListNode *removeNthFromEnd(ListNode *head, int n) { if(head == NULL) return NULL; ListNode dummyHead(0); dummyHead.next = head; ListNode *fast = &dummyHead, *slow = &dummyHead; while(n--) fast = fast->next; while(fast->next != NULL) { fast = fast->next; slow = slow->next; } slow->next = slow->next->next; return dummyHead.next; }
原文链接:https://leetcode.com/discuss/1656/is-there-a-solution-with-one-pass-and-o-1-space
转载于:https://www.cnblogs.com/gattaca/p/4328915.html
标签:Node,head,dummyHead,End,fast,next,Nth,slow,ListNode 来源: https://blog.csdn.net/weixin_33939843/article/details/94309033
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。