public class MyLinkedList {
private Node first;
private Node last;
int size;
void rangeCheck(int index){
if(index<0||index>size-1)
{
try{}
catch(Exception ex){
System.out.println("the index is out of range!");
}
}
}
public void add(Object obj){
Node n=new Node();
n.obj=obj;
n.next=null;
if(first==null)
{
n.previous=null;
first=n;
last=n;
}
else{
last.next=n;
n.previous=last;
last=n;
}
size++;
}
public Node get(int index){
rangeCheck(index);
Node tmp=first;
for(int i=0;i<index;i++)
{
tmp=tmp.next;
}
return tmp;
}
public static void main(String[] args) {
MyLinkedList l=new MyLinkedList();
l.add("i");
l.add("love");
l.add("day");
l.add("toy!");
System.out.println((String)l.get(2).obj);
}
}
class Node{
Node previous;
Node next;
Object obj;
}
自己实现一部分linkedlist
最新推荐文章于 2024-05-03 14:09:07 发布