剑指Offer14：链表中倒数第k个结点

剑指Offer14：链表中倒数第k个结点

1.题目

输入一个链表，输出该链表中倒数第k个结点。

2.思路

我们可以定义两个指针。第一个指针从链表的头指针开始遍历向前走k-1，第二个指针保持不动；从第k步开始，第二个指针也开始从链表的头指针开始遍历。由于两个指针的距离保持在k-1，当第一个（走在前面的）指针到达链表的尾结点时，第二个指针（走在后面的）指针正好是倒数第k个结点。

3.代码

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
    if(pListHead == NULL || k == 0){
        return NULL;
    }
    ListNode *pAhead = pListHead;
    ListNode *pBehind = pListHead;
    for(unsigned int i = 0; i<k-1; i++){
        if(pAhead->next != NULL){
            pAhead = pAhead->next;
        }
        else{
            return NULL;
        }
    }
    while(pAhead->next != NULL){
        pAhead = pAhead->next;
        pBehind = pBehind->next;
    }
    return pBehind;
    }
};

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def FindKthToTail(self, head, k):
        # write code here
        if head == None or k == 0:
            return None
        phead = head
        pbehind = head
        for i in range(k-1):
            if phead.next == None:
                return None
            else:
                phead = phead.next
        while phead.next != None:
            phead = phead.next
            pbehind = pbehind.next
        return pbehind