链表1-1 1-2

package com.tx.LinkedList;

public class LinkedList<E> {
    private class Node {

        public E e;

        public Node next;

        public Node(E e, Node node){
            this.e = e;
            this.next = next ;
        }
        public Node(E e){
            this(e,null);
        }
        public Node(){
            this(null,null);
        }

        @Override
        public String toString() {
            return "Node{" +
                    "e=" + e +
                    ", next=" + next +
                    '}';
        }

        private Node head;
        private int size;
//
//        public LinkedList(){
//            new Node(null)
//          //  head = null;
//            size = 0;
//        }
        public int getSize() {
            return size;
        }
        public boolean isEmpty(){
            return size == 0;
        }

        //在链表头添加新的元素
        public void addFirst(E e){
//            Node node = new Node(0);
//            node.next = head;
//            head = node;

            head = new Node(e,head);
            size ++;
        }
        // 在链表的index（0-based）位置添加新的元素e
        // 在链表中不是一个常用的操作，练习用：
        public void add(int index,E e){
            if(index < 0 || index > size )
                throw new IllegalArgumentException("Add failed,Illegal index.");
            if(index == 0)
                addFirst(e);
            else{
                Node prev = head;
                for (int i = 0; i < index - 1;i++){
                    prev = prev.next;
//                    Node node = new Node(e);
//                    node.next = prev.next;
//                    prev.next = node ;
//

                    prev.next = new Node(e,prev.next);
                    size ++;
                }
            }

        }

        // 在链表末尾添加新的元素e
        public void addList(E e) {
            add(size,e);
        }


    }
}