lindaZ

摘要： class LNode { public LNode next; public int data; } /*找出倒数第k个元素，只遍历一遍*/ class Kk { private static LNode head = new LNode();; private static LNode node; private static LNode tail; ... 阅读全文