题目来源:LintCode
原题地址:http://www.lintcode.com/zh-cn/problem/nth-to-last-node-in-list/
题目:
找到单链表倒数第n个节点,保证链表中节点的最少数量为n。
您在真实的面试中是否遇到过这个题?
Yes
样例
给出链表 3->2->1->5->null和n = 2,返回倒数第二个节点的值1.
难度级别:
容易
容易
实现代码:
/**
* Definition of ListNode
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution
{
public:
/**
* @param head: The first node of linked list.
* @param n: An integer.
* @return: The head of linked list.
*/
ListNode *nthToLast(ListNode *head, int n)
{
if (head == NULL)
{
return head;
}
ListNode *myHead = new ListNode(0);
myHead->next = head;
ListNode *p = myHead;
ListNode *q = myHead;
for (int i = 0; i < n; i++)
{
p = p->next;
}
while (p->next != NULL)
{
p = p->next;
q = q->next;
}
/*p = q->next;
q->next = q->next->next;
free(p);*/
return q->next;
}
};