Custom SingllyLinkList By java code

package com.kartik.tutorials;

/**

 * @author KartikKC

*/ 

public class MyLinkListTest {

     public static void main(String[] args) {

        MyLinkList lList = new MyLinkList();

         // add elements to LinkedList

        lList.add("1");

        lList.add("2");

        lList.add("3");

        lList.add("4");

        lList.add("5");

        /*

         * Please note that primitive values can not be added into LinkedList

         * directly. They must be converted to their corresponding wrapper

         * class.

         */

        System.out.println("lList - print linkedlist: " + lList);

        System.out.println("lList.size() - print linkedlist size: " + lList.size());

        System.out.println("lList.get(3) - get 3rd element: " + lList.get(3));

        System.out.println("lList.remove(2) - remove 2nd element: " + lList.remove(2));

        System.out.println("lList.get(3) - get 3rd element: " + lList.get(3));

        System.out.println("lList.size() - print linkedlist size: " + lList.size());

        System.out.println("lList - print linkedlist: " + lList);

    }

}

class MyLinkList {

    // reference to the head node.

    private Node head;

    private int listCount;

    // LinkedList constructor

    public MyLinkList() {

        // this is an empty list, so the reference to the head node

        // is set to a new node with no data

        head = new Node(null);

        listCount = 0;

    }

    public void add(Object data)

    // appends the specified element to the end of this list.

    {

        Node temp = new Node(data);

        Node current = head;

        // starting at the head node, crawl to the end of the list

        while (current.getNext() != null) {

            current = current.getNext();

        }

        // the last node's "next" reference set to our new node

        current.setNext(temp);

        listCount++;// increment the number of elements variable

    }

    public void add(Object data, int index)

    // inserts the specified element at the specified position in this list

    {

        Node temp = new Node(data);

        Node current = head;

        // crawl to the requested index or the last element in the list,

        // whichever comes first

        for (int i = 1; i < index && current.getNext() != null; i++) {

            current = current.getNext();

        }

        // set the new node's next-node reference to this node's next-node

        // reference

        temp.setNext(current.getNext());

        // now set this node's next-node reference to the new node

        current.setNext(temp);

        listCount++;// increment the number of elements variable

    }

    public Object get(int index)

    // returns the element at the specified position in this list.

    {

        // index must be 1 or higher

        if (index <= 0)

            return null;

        Node current = head.getNext();

        for (int i = 1; i < index; i++) {

            if (current.getNext() == null)

                return null;

            current = current.getNext();

        }

        return current.getData();

    }

    public boolean remove(int index)

    // removes the element at the specified position in this list.

    {

        // if the index is out of range, exit

        if (index < 1 || index > size())

            return false;

        Node current = head;

        for (int i = 1; i < index; i++) {

            if (current.getNext() == null)

                return false;

            current = current.getNext();

        }

        current.setNext(current.getNext().getNext());

        listCount--; // decrement the number of elements variable

        return true;

    }

    public int size()

    // returns the number of elements in this list.

    {

        return listCount;

    }

    public String toString() {

        Node current = head.getNext();

        String output = "";

        while (current != null) {

            output += "[" + current.getData().toString() + "]";

            current = current.getNext();

        }

        return output;

    }

    private class Node {

        // reference to the next node in the chain,

        // or null if there isn't one.

        Node next;

        // data carried by this node.

        // could be of any type you need.

        Object data;

        // Node constructor

        public Node(Object dataValue) {

            next = null;

            data = dataValue;

        }

        // another Node constructor if we want to

        // specify the node to point to.

        public Node(Object dataValue, Node nextValue) {

            next = nextValue;

            data = dataValue;

        }

        // these methods should be self-explanatory

        public Object getData() {

            return data;

        }

        public void setData(Object dataValue) {

            data = dataValue;

        }

        public Node getNext() {

            return next;

        }

        public void setNext(Node nextValue) {

            next = nextValue;

        }

    }

}

• Tweet
• Share
• Share
• Share
• Share

About Kartik Chandra Mandal

I am Kartik Chandra Mandal from Bangalore, India. Working as software engineer in Java technology. Have good knowledge of OWASP and CSRF in security for applications and it's implementation in Java technology.

Related Post