leetcode---Remove Nth Node From End of List
来源:互联网 发布:浙江华通云数据上市 编辑:程序博客网 时间:2024/06/09 21:33
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. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* removeNthFromEnd(ListNode* head, int n) { if (head == NULL) return NULL; ListNode *p = head, *q = head; int index = 0; while(index < n) { p = p->next; index++; } if(p == NULL) return head->next; else { while(p->next) { p = p->next; q = q->next; } } q->next = q->next->next; return head; }};
0 0
- LeetCode[Linked List]: Remove Nth Node From End of List
- 19. Remove Nth Node From End of List leetcode list
- [Leetcode]LeetCode 19:Remove Nth Node From End of List
- LeetCode: Remove Nth Node From End of List
- LeetCode: Remove Nth Node From End of List
- [Leetcode] Remove Nth Node From End of List
- LeetCode: Remove Nth Node From End of List
- leetcode 40: Remove Nth Node From End of List
- [LeetCode] Remove Nth Node From End of List
- Leetcode 19 Remove Nth Node From End of List
- [Leetcode] Remove Nth Node From End of List
- [LeetCode]Remove Nth Node From End of List
- LeetCode-Remove Nth Node From End of List
- [LeetCode] Remove Nth Node From End of List
- LeetCode 19: Remove Nth Node From End of List
- LeetCode - Remove Nth Node From End of List
- LeetCode | Remove Nth Node From End of List
- leetcode之Remove Nth Node From End of List
- 归并排序
- Android开发:GPU过度绘制的优化
- iOS开发的一些小技巧
- OpenCV通过cvFindContours与cvDrawCountours函数查找轮廓
- 文章标题
- leetcode---Remove Nth Node From End of List
- 《Thinking in Java》第五篇笔记 就Java中的操作流程简单说几句
- leetcode:Substring with Concatenation of All Words
- sql基本用法
- 设计模式-策略模式(c++实现)
- 三子棋
- ubuntu系统下建立wifi热点
- 自定义Toast显示时常,未验证
- 【转】 c++面试题目