过于简单,不再赘述。
package com.niuke;
/**
* @Author YuLing
* @Date 2024-05-12 22:21
* @Description:
* @Version 1.0
*/
public class BM8 {
public ListNode FindKthToTail(ListNode pHead, int k) {//倒数第k个结点 正数
ListNode cur = pHead;
int len = 0;
while (cur != null) {
cur = cur.next;
len++;
}
int di = len - k;
if (di < 0) return null;
cur = pHead;
for (int i = 0; i < di; i++) {
cur = cur.next;
}
return cur;
}
static class ListNode {
int val;
ListNode next = null;
public ListNode(int val) {
this.val = val;
}
@Override
public String toString() {
return "ListNode{" +
"val=" + val +
", next=" + next +
'}';
}
}
}