输入一个链表,输出该链表中倒数第k个结点. /* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { public ListNode FindKthToTail(ListNode head,int k) { if(head == null){ return null; } ListNode P1 = head
题目描述 输入一个链表,输出该链表中倒数第k个结点. class Solution: def FindKthToTail(self, head, k): # write code here res=[] length=0 while not head==None: res.append(head) head=head.next length+=1 if length-k>=0 and k is not 0: return res[length-k] else: return None 思路:还可