题目描述
输入一个链表,输出该链表中倒数第k个结点。
# -*- 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
#双指针,指针1一个从k步以后,指针2一个从开头走,这样两指针一直相聚k
#指针1到结尾时,指针2即在倒数第k个节点处
if head == None or k <=0:
return None
p1 =head
p2 =head
for i in range(k-1):
if p1.next == None:
return None
p1 = p1.next
while p1.next != None:
p1 = p1.next
p2 = p2.next
return p2