Java基础学习笔记二十五 容器（LinkedList）

LinkedList

底层用双向链表现的存储。
特点：查询效率低，增删效率高，线程不安全。
双向链也叫双链表，是链表的一种，它的每个数据节点中都有两个指针，分别指向前一个节点和后一个节点。所以，双向链表中的任意一个节点开始，都可以很方便地找到所有节点。

每个节点都应该有3部分内容：

class Node {
	Node previous; //前一个节点
	Object element;//本节点保存的数据
	Node next;     //后一个节点
}

自定义实现LinkedList

public class Node {
    Node previous;
    Node next;
    Object element;
    
    public Node(Node previous,Node next,Object element){
        super();
        this.previous = previous;
        this.next = next;
        this.element = element;
    }
    public Node(Object element){
    	super();
    	this.element = element;
    }
}

/**
 * 
 * 自定义实现LinkedList
 * @author：Jsp
 *
 */

public class JspLinkedList <E> {	
	private   Node  first;
	private  Node  last;
	private  int size;
	
	public  void  add(int index, E  element) {   	
		checkRange(index);
		Node  newNode = new Node(element);
		Node  temp  =  getNode(index);
		
		if(temp!=null){
			Node up = temp.previous;		
			up.next = newNode;
			newNode.previous = up;
			
			newNode.next = temp;
			temp.previous = newNode;			
		}			
	}	
	public void remove(int index){	
		checkRange(index);
		Node  temp  =  getNode(index);
		if(temp!=null){
			Node  up = temp.previous;
			Node down = temp.next;
			
			if(up!=null){
				up.next = down;
			}	
			if(down!=null){
				down.previous = up;
			}
			//被删除元素是第一个元素时
			if(index==0){
				first = down;
			}	
			//被删除的元素是最后一个元素时
			if(index == size-1){
				last = up;
			}	
			size--;
		}	
	}
	//[]    
	//["a","b","c","d","e","f"]           2
	public E get(int index) {  
		checkRange(index);	
		Node temp = getNode(index);	
		return temp!=null?(E)temp.element:null;
	}
	private void checkRange(int index){
		if(index<0||index>size-1){
			throw  new RuntimeException("索引数字不合法:"+index);
		}
	}
	private Node getNode(int index){		
		checkRange(index);	
		Node  temp = null;
	
		if(index<=(size>>1)){   //size>>1相当于除2
			temp = first;
			for(int i=0;i<index;i++){
				temp = temp.next;
			}
		}else{
			temp = last;
			for(int i=size-1; i>index;i--){
				temp = temp.previous;
			}
		}	
		return temp;
	}
	public void add(E  element) {
		Node node  = new Node(element);	
		if(first==null){
//			node.previous = null;
//			node.next = null;
			first = node;
			last = node;
		}else{	
			node.previous = last;
			node.next = null;		
			last.next = node;
			last = node;	
		}	
		size++;		
	}
	
	@Override
	public String toString() {
		//[a,b,c]     first=a,    last=c
		//a,b,c
		StringBuilder   sb = new StringBuilder("[");
		Node  temp = first;
		while(temp!=null){
			sb.append(temp.element+",");
			temp = temp.next;
		}
		sb.setCharAt(sb.length()-1, ']'); 
		
		return sb.toString();
	}	
	
	public static void main(String[] args) {
		SxtLinkedList05<String>  list = new SxtLinkedList05<>();
		
		list.add("a");
		list.add("b");
		
		System.out.println(list);	
		System.out.println(list.get(1));		
	}		
}