package java2019;
//输入一个链表,输出该链表中倒数第K个节点
public class Demo13 {
public ListNode FindkThToTail(ListNode list,int k){
int count = 0;
ListNode p = list;
while(p!=null){
count++;
p=p.getNext();
}//链表长度
if(k>count)
throw new RuntimeException("k输入超过链表长度");
p=list;
for(int i=1;i<=count-k;i++){
p=p.getNext();
}
return p;
}
public static void main(String[] args) {
ListNode root = new ListNode(1);
ListNode n1 = new ListNode(2);
ListNode n2 = new ListNode(3);
ListNode n3 = new ListNode(4);
root.setNext(n1);
n1.setNext(n2);
n2.setNext(n3);
Demo13 d13 = new Demo13();
int result = d13.FindkThToTail(root, 1).getVal();
System.out.println(result);
}
}
13.输入一个链表,输出该链表中倒数第K个节点
最新推荐文章于 2022-01-20 13:25:52 发布