双向循环链表

package com.czz.双向循环链表;

public class LinkedList3<E> {

    private int size;
    private Node<E> first;
    private Node<E> last;
    
    class Node<E>{
    	E element;
    	Node<E> prev;
    	Node<E> next;
		public Node(E element, Node<E> prev, Node<E> next) {
			this.element = element;
			this.prev = prev;
			this.next = next;
		}
		
		public String toString() {
			
			StringBuilder sb =new StringBuilder();
			sb.append(prev.element).append("_").append(element).append("_").append(next.element);
			return sb.toString();
		}
    }
    
    
    public int size() {
		return size;
	}
	
	public E get(int index) {
		return node(index).element;
	}
	
	public E set(int index,E element) {
		Node<E> node=node(index);
		E old=node.element;
		
		old=element;
		
		return old;
	}
	
	public boolean isEmpty() {
		return size==0;
	}
	
	public boolean contains(E element) {
		
		return  indexOf(element)!=-1;
	}
	
	public int indexOf(E element) {
		if(element==null) {
			
			Node<E> node=first;
			for (int i = 0; i < size; i++) {
				if(element.equals(node.element))
					return i;
				node=node.next;
			}
			
		}else {
			Node<E> node=first;
			for (int i = 0; i < size; i++) {
				if(element.equals(node.element))
					return i;
				node=node.next;
			}
		}
		
		
		return -1;
	}
	public void add(E element) {
		add(size,element);
	}

	public void add(int index, E element) {
	
		if(index==size) {//往最后面添加元素
			Node<E> oldlast =last;
			last=new Node<>(element, oldlast, first);
			if(oldlast==null) {
				first=last;
				first.next=first;
				first.prev=first;
				
			}else {
			oldlast.next=last;
			first.prev=last;
			}
		}else {
			Node<E> next=node(index);
			Node<E> prev=next.prev;
			Node<E> node=new Node<>(element, prev, next);
			next.prev=node;
			prev.next=node;	
			if(index==0) {
				first=node;
			}else {
					
			}
		}
		size++;
	}
	public E remove(int index) {
		
		Node<E> node=first;
		if(size==1) {
			first=null;
			last=null;
			
		}else {
			node=node(index);
			Node<E> prev=node.prev;
			Node<E> next=node.next;
			prev.next=next;
			next.prev=prev;
			if(index==0) {
				first =next;
			}
			if(node==last) {
				last=prev;
			}
		}
		
		size--;
		return node.element;
	}
	public void clear() {
		size=0;
		first=null;
		last=null;
	}
	
	public Node<E> node(int index){
		
		if(index<0||index> size) {
			throw new IndexOutOfBoundsException("index"+index+","+"size"+size);
		
		}
		if(index<size>>1) {
			Node<E> node=first;
			
			for (int i = 0; i < index; i++) {
				node=node.next;
			}
			return node;
		}else {
			Node<E> node =last;
			for (int i = size-1; i >index; i--) {
				node=node.prev;
			}
			return node;
		}
		
	}
	
	@Override
	public String toString() {
		
		StringBuilder sb=new StringBuilder();
		sb.append("size=").append(size);
		sb.append("[ ");
		Node<E> node=first;
		for (int i = 0; i < size; i++) {
			if(i!=0) {
				sb.append(",");
			}
			sb.append(node);
			node=node.next;
		}
		
		sb.append("]");
		return sb.toString();
	}
}

package com.czz.双向循环链表;

public class TestDemo {

	public static void main(String[] args) {
		LinkedList3<Integer> list=new LinkedList3<>();
		list.add(11);
		list.add(22);
		list.add(33);
		list.add(44);
		
		list.add(0,55);//55 11 22 33 44 
		 
		System.out.println(list);
	}
}