从尾到头打印链表:
题目描述:
输入一个链表,输出该链表中倒数第k个结点。
输入描述:
输出描述:
示例1:
输入:
输出:
代码:
/*
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 || k <= 0) {
return null;
}
ListNode slow = head;
ListNode fast = head;
for (int i = 1; i < k; i++) {
if (fast.next == null) {
return null;
}
fast = fast.next;
}
while (fast.next != null) {
fast = fast.next;
slow = slow.next;
}
return slow;
}
}