题目:
输入一个链表,输出该链表中倒数第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) {
int len = size(head);
if (k < 0 || k > len) {
return null;
}
if (k == len) {
return head;
}
for (int i = 0; i < len - k; i++) {
head = head.next;
}
return head;
}
public int size(ListNode head) {
int size = 0;
for (ListNode cur = head; cur != null; cur = cur.next) {
size++;
}
return size;
}
}