public static void main(String[] args) {
LinkedListWithSize<Integer> lk = new LinkedListWithSize<>();
for (int i = 0 ; i < 3 ; i++)
lk.add(i,i);
System.out.println(lk);
System.out.println(lk.getfindkLast(2));
System.out.println(lk.getmin());
}
private T getmin(){
Node<T> p = head;
Node<T> q = head;
if (head == null)
return null;
while (q.next !=null&&q.next.next!=null) {
p = p.next;
q = q.next.next;
}
return p.data;
}
private T getfindkLast( int k) {
if (k<=0)
return null;
Node<T> p = head;
try{
for (int i = 0 ; i < k-1; i ++)
p = p.next;
Node<T> q = head;
while (p.next!=null){
p = p.next;
q = q.next;
}
return q.data;
}catch (NullPointerException e){
return null;
}
}
private void delectjishu(){
Node<T> p = head,t;
if (isEmpty()||p.next == null)
return;
while (p.next!=null&&p.next.next !=null){
t = p.next;
p.next = p.next.next;
t.data = null;
t.next =null;
p = p.next;
}
}