单向循环链表

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

public class LinkedList<E> {

	private int size;
	private Node<E> first;
	
	private static class Node<E>{
		E element;
		Node<E> next;
		public Node(E element, Node<E> next) {
			super();
			this.element = element;
			this.next = next;
		}
		
		@Override
		public String toString() {
			StringBuilder sb =new StringBuilder();
			
			sb.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==0) {
		Node<E>	newfirst = new Node<>(element, first);
		//拿到最后一个节点
		Node<E> last=(size==0)? newfirst:node(size-1);
		last.next=newfirst;
		first=newfirst;
		}else {
			Node<E> prev=node(index-1);
			prev.next = new Node<>(element, prev.next);
		}
		size++;
	}
	public E remove(int index) {
		
		Node<E> node=first;
		if(index==0) {
			if(size==1) {
				first=null;
			}else {
				//拿到最后一个节点
				Node<E> last =node(size-1);
				first=first.next;
				last.next=first;
			}
			
		}else {
			Node<E> prev = node(index-1);
			node=prev.next;
			prev.next=prev.next.next;
		}
		size--;
		return node.element;
	}
	public void clear() {
		size=0;
		first=null;
	}
	
	public Node<E> node(int index){
		
		if(index<0||index> size) {
			throw new IndexOutOfBoundsException("index"+index+","+"size"+size);
		
		}
		Node<E> node=first;
		
		for (int i = 0; i < index; i++) {
			node=node.next;
		}
		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 Test3 {

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