Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
A linked list class implemented in Java
/*============================================================================
Name : LinkedList.java
Author : Eric Swanson
Date : Sep 7, 2011
Version :
Description :
Copyright (C) 2011 netherwolfe
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
============================================================================*/
class LinkedList
{
//Class variables for the Linked List
private static Node head;
private static int numNodes;
public static void main(String [] args)
{
System.out.println("/=/=/=/= TESTING /=/=/=/=");
LinkedList ll = new LinkedList(10);
ll.addAtHead(11);
ll.addAtHead(12);
ll.addAtHead(13);
ll.addAtTail(8);
ll.addAtTail(7);
ll.addAtIndex(4,9);
ll.addAtIndex(4,9);
ll.deleteAtIndex(4);
ll.printList();
}
public LinkedList(Object dat)
{
head = new Node(dat);
}
public void addAtHead(Object dat)
{
Node temp = head;
head = new Node(dat);
head.next = temp;
numNodes++;
}
public void addAtTail(Object dat)
{
Node temp = head;
while(temp.next != null)
{
temp = temp.next;
}
temp.next = new Node(dat);
numNodes++;
}
public void addAtIndex(int index, Object dat)
{
Node temp = head;
Node holder;
for(int i=0; i < index-1 && temp.next != null; i++)
{
temp = temp.next;
}
holder = temp.next;
temp.next = new Node(dat);
temp.next.next = holder;
numNodes++;
}
public void deleteAtIndex(int index)
{
Node temp = head;
for(int i=0; i< index - 1 && temp.next != null; i++)
{
temp = temp.next;
}
temp.next = temp.next.next;
numNodes--;
}
public static int find(Node n)
{
Node t = head;
int index = 0;
while(t != n)
{
index++;
t = t.next;
}
return index;
}
public static Node find(int index)
{
Node temp=head;
for(int i=0; i<index; i++)
{
temp = temp.next;
}
return temp;
}
public static void printList()
{
Node temp = head;
while(temp != null)
{
System.out.println(temp.data);
temp = temp.next;
}
}
public static int getSize()
{
return numNodes;
}
class Node
{
//Declare class variables
private Node next;
private Object data;
public Node(Object dat)
{
data = dat;
}
public Object getData()
{
return data;
}
}
}
@nileshparwan

This comment has been minimized.

Copy link

nileshparwan commented Aug 22, 2017

Can i have a more detail explanation please. i'm having lot of difficulty in this type of question.
Can you help me
thanks
please email it to me on nileshparwan.utm.bse16b@gmail.com

@tail-recursion

This comment has been minimized.

Copy link

tail-recursion commented May 5, 2018

Is there any reason for using Object rather than generics?

@carlylou

This comment has been minimized.

Copy link

carlylou commented Oct 22, 2018

In method addAtIndex(int index, Object dat), what if index equals to 0? In this case, I want to insert a node at head position. And this function will add after head still.

@carlylou

This comment has been minimized.

Copy link

carlylou commented Oct 22, 2018

And in line 99, why we do not use while( ! t.equals(n)) ?

@jiachen247

This comment has been minimized.

Copy link

jiachen247 commented Jan 30, 2019

prefer generics over base object!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.