LinkedList
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218
class LinkedList{
int length;
Node head;
Node tail;
class Node
{
int value;
Node next;
Node(int value)
{
this.value = value;
}
}
public LinkedList(int value)
{
Node NewNode = new Node(value);
head = NewNode;
tail = NewNode;
length = 1;
}
public void printList()
{
Node temp = head;
while(temp!= null)
{
System.out.println(temp.value);
temp=temp.next;
}
}
public void append(int value)
{
Node NewNode = new Node(value);
if(length == 0)
{
head = NewNode;
tail = NewNode;
}
else
{
tail.next = NewNode;
tail = NewNode;
}
length++;
}
public Node RemoveLast()
{
if(length == 0)
{
return null;
}
else
{
Node temp=head;
Node pre=head;
while(temp.next!= null)
{
pre = temp;
temp = temp.next;
}
tail = pre;
tail.next = null;
length--;
if(length==0)
{
head = null;
tail = null;
}
return temp;
}
}
public void prepend(int value)
{
Node NewNode = new Node(value);
if(length == 0)
{
head = NewNode;
tail = NewNode;
}
else
{
NewNode.next = head;
head = NewNode;
}
length++;
}
public Node RemoveFirst()
{
if(length == 0)
{
return null;
}
else
{
Node temp=head;
head = head.next;
temp.next = null;
length--;
if(length == 0)
{
head = null;
tail = null;
}
return temp;
}
}
public Node get(int index)
{
if(index < 0 || index >= length)
{
return null;
}
else
{
Node temp = head;
for(int i=0;i<index;i++)
{
temp = temp.next;
}
return temp;
}
}
public boolean set(int index, int value)
{
Node temp = get(index);
if(temp!=null)
{
temp.value = value;
return true;
}
else
{
return false;
}
}
public boolean insert(int index,int value)
{
if(index == 0)
{
prepend(value);
return true;
}
else if(index == length)
{
append(value);
return true;
}
else
{
Node NewNode = new Node(value);
Node temp = get(index-1);
NewNode.next = temp.next;
temp.next = NewNode;
length++;
return true;
}
}
public Node Remove(int index)
{
if(index>=length || index<0)
{
return null;
}
else if(index == 0)
{
return RemoveFirst();
}
else if(index == length-1)
{
return RemoveLast();
}
else
{
Node prev = get(index-1);
Node temp=prev.next;
prev.next = temp.next;
temp.next = null;
length--;
return temp;
}
}
}
class Main {
public static void main(String[] args) {
LinkedList myLinkedList = new LinkedList(1);
myLinkedList.append(2);
myLinkedList.append(3);
myLinkedList.append(4);
myLinkedList.prepend(6);
myLinkedList.printList();
System.out.println("List after inserting");
myLinkedList.insert(2,9);
myLinkedList.printList();
System.out.println("List after removing");
System.out.println(myLinkedList.Remove(3).value);
myLinkedList.printList();
// System.out.println("Index :"+myLinkedList.get(2).value);
// System.out.println("RemoveFirst: "+myLinkedList.RemoveFirst().value);
// System.out.println("RemoveLast: "+myLinkedList.RemoveLast().value);
// myLinkedList.printList();
// System.out.println("Linked List After Set operation");
// myLinkedList.set(1,7);
// myLinkedList.printList();
}
}
Java
INFO