src/main/java/net/jrtechs/www/DataStructures/LinkedList/LinkedList.java → src/main/java/net/jrtechs/www/DataStructures/Lists/LinkedList/LinkedList.javaVoir le fichier
@ -33,6 +32,27 @@ public class LinkedList implements IList
}
/**
*Createsanewlinkedlistwithan
*initialelementstoredinsideofit
*
*@paramoinitialelement
*/
publicLinkedList(Eo)
{
this.head=newNode<>(o);
this.tail=head;
this.size=1;
}
/**
*Addsadataelementtothelinkedlist.
*
*@paramoelementtogetadded
*@return
*/
@Override
publicbooleanadd(Eo)
{
this.size++;
@ -51,6 +71,13 @@ public class LinkedList implements IList
}
/**
*Checkstoseeiflistcontainstheelement
*
*@paramoelementtoseeifexists
*@return
*/
@Override
publicbooleancontains(Eo)
{
Nodecurrent=this.head;
@ -67,16 +94,28 @@ public class LinkedList implements IList
}
/**
*Returnsthesizeofthelinkedlist
*
*@return
*/
publicintsize()
{
returnthis.size;
}
/**
*Removesanelementataspecificindexinthe
*linkedlist
*
*@paramindexofelementtoremove
*@returnelementremoved,ornullifthe
*elementisnotfound
*/
publicEremove(intindex)
{
intcount=0;
Node<E>current=this.head;
Node<E>previous=null;
while(current!=null)
@ -102,6 +141,47 @@ public class LinkedList implements IList
}
/**
*Removesaspecificelementfromthelinkedlist
*
*@paramoelementtoremove
*@returnelementremovedornullifelementisnot
*inthelist
*/
@Override
publicEremove(Eo)
{
Node<E>current=this.head;
Node<E>previous=null;
while(current!=null)
{
if(current.getData().equals(o))
{
if(previous==null)
{
this.head=current.getNext();
}
else
{
previous.setNext(current.getNext());
}
this.size--;
returncurrent.getData();
}
previous=current;
current=current.getNext();
}
returnnull;
}
/**
*Returnstheelementataspecificindex
*ofthelinkedlist.
*
*@paramindexofdesiredelement
*@return
*/
publicEget(intindex)
{
intcount=0;
src/test/java/net/jrtechs/www/DataStructures/LinkedList/LinkedListTest.java → src/test/java/net/jrtechs/www/DataStructures/Lists/LinkedListTest.javaVoir le fichier