给定一个非空单链表,返回其倒数第k个节点。 要求:不改变和新增任何节点。
list:非空单链表头节点 k: 给定整数,且k>=1 and k<=len(list)
list的倒数第k个节点
list=list(1,2,3,4,5) k=2
list(4,5)
import java.util.*; public class Main { /** //该段代码仅用于调试,提交时请注释该段代码 class LinkNode<T> { public T data; public LinkNode<T> next; } */ public LinkNode<Integer> solution(LinkNode<Integer> list,int k) { LinkNode<Integer> former = list, latter = list; for(int i = 0; i < k; i++) former = former.next; while(former != null) { former = former.next; latter = latter.next; } return latter; } }