剑指offer14-输入一个链表，输出该链表中倒数第k个结点

package JZoffertest;

import JZoffertest.test3.ListNode;

public class test14a {
	public ListNode FindKthToTail(ListNode head,int k) {
		if(head==null||k<=0) {
			return null;
		}
		ListNode  pre=head;
		ListNode  last=head;
		for(int i=1;i

package JZoffertest;

import java.util.Stack;

import JZoffertest.test3.ListNode;

public class test14 {
	
	 public ListNode FindKthToTail(ListNode head,int k) {
		 if(head==null||k<=0) {
			 return null;
		 }
		
		//先将链表翻转，再打印第k个
		 Stack stack=new Stack();
		 int count=0;
		while(head!=null) {
			stack.push(head);
			head=head.next;
			count++;
		}
		if(count