java版查找链表最后k个元素

package com.test;


public class Test {
class Node{
private int num;
private Node next;
public Node(int num,Node node){
this.num = num;
this.next = node;
}
public void setNum(int num){
this.num = num;
}
public void setNext(Node node){
this.next = node;
}
}
/**
* 创建链表
* @param arr
* @param len
* @return
*/
public Node createList(int arr[],int len){
Node head = null;
if(len < 1){
return null;
}
head = new Node(arr[0],null);
Node next = head;
Node temp = null;
for(int i=1;i<len;i++){
temp = new Node(arr[i],null);
next.next = temp;
next = temp;
}
return head;
}
/**
* 查找链表最后k个元素
* @param head
* @param k
* @return
*/
public Node findLastKth(Node head,int k){
int count = 0;
Node next = head;
while(next != null){
count++;
next = next.next;
if(count == k){
break;
}
}
if(next == null){
return null;
}
while(next != null){
head = head.next;
next = next.next;
}
return head;
}
/**
* 打印链表
* @param node
*/
public void printList(Node node){
while(node != null){
System.out.print(node.num+",");
node = node.next;
}
System.out.println();
}
/**
* 测试
*/
public static void test(){
String str = new String();
str = str+"hello";
System.out.println(str);
int arr[] = {1,2,3,4,5,6,7,8};
Test test = new Test();
Node head = test.createList(arr, arr.length);
test.printList(head);
System.out.println("-------------");
head = test.findLastKth(head,5);
System.out.println("-------------");
test.printList(head);
}

public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("hello java!");
int temp[] = {10,8,8,7,6,5,4,3,2,1,0};
int index = Test.search(temp, 11, 8);
//System.out.println(index);
int arr1[] = {2,3,4,5,6};
int arr2[] = {1,3,5,6,7,8,9};
int number = Test.findKth(arr1, arr2, 5, 7, 2);
//System.out.println(number);
Test.test();
}


}