题目描述:
输出一个单向链表,找出倒数第k个结点的值
输入描述:
1.输入链表结点的个数
2.输入链表的值
3.输入k的值
示例1:
输入:
8
1 2 3 4 5 6 7 8
7
输出:
2
代码:
方法一:用LinkedList实现
import java.util.LinkedList;
import java.util.Scanner;
public class Test {
static class Node {
int data;
Node next;
public Node(int data) {
this.data = data;
}
}
public static Integer find(Node head, int k) {
if (head == null) {
return null;
}
Node fast = head;
Node slow = head;
while (--k>0){
fast = fast.next;
}
while (fast.next!=null){
fast=fast.next;
slow = slow.next;
}
return slow.data;
}
public static void main(String[] args) {
Scanner