Skip to content

Instantly share code, notes, and snippets.

@tzafrir

tzafrir/gist:3737339

Created September 17, 2012 13:44
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save tzafrir/3737339 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save tzafrir/3737339 to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. @invalid-email-address Anonymous created this gist Sep 17, 2012.
    74 changes: 74 additions & 0 deletions gistfile1.java
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,74 @@
    import java.lang.IndexOutOfBoundsException;

    public class Main {
    public static void main(String args[]) {
    LinkedList<Integer> l = new LinkedList<Integer>();
    l.add(4);
    l.add(0);
    l.add(9);
    l.add(131, 1);
    l.add(12);
    l.add(151, 5);
    for (int i = 0; i < l.size(); ++i) {
    System.out.println(l.get(i));
    }
    }
    }

    class LinkedList<T> {
    private class Node {
    public T data;
    public Node next = null;
    public Node(T data) {
    this.data = data;
    }
    }
    Node head = new Node(null);
    int size = 0;

    public LinkedList() {

    }

    public int size() {
    return size;
    }

    public boolean add(T e) {
    Node n = head;
    for (; n.next != null; n = n.next);
    n.next = new Node(e);
    ++size;
    return true;
    }

    public boolean add(T e, int i) {
    if (i < 0 || i > size) {
    throw new IndexOutOfBoundsException();
    }
    if (i == size) {
    add(e);
    return true;
    }
    Node n = head;
    for (int j = 0; j < i; j++) {
    n = n.next;
    }
    Node next = n.next;
    n.next = new Node(e);
    n.next.next = next;
    ++size;
    return true;
    }

    public T get(int i) {
    if (i < 0 || i >= size) {
    throw new IndexOutOfBoundsException();
    }
    Node n = head;
    for (int j = 0; j < i + 1; j++) {
    n = n.next;
    }
    return n.data;
    }
    }