手写LinkedList, 增加小封装，增加泛型约束（5）

package com.jianshun;

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;
	}
}

package com.jianshun;
/**
 * 自定义一个链表
 * 增加小的封装，增加泛型
 * @author Administrator
 *
 */
public class SxtLinkedList05<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;
			if(up == null){//把元素插入到位首
				first = newNode;
				newNode.next = temp;
				temp.previous = newNode;
			}else if(size == index){//将元素插入到末尾
				//待续
			}else{
				up.next = newNode;
				newNode.previous = up;
				newNode.next = temp;
				temp.previous = newNode;
			}
		}
		size++;
	}
	
	//[]
	//['a','b','c']
	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++;
	}			
	
	//根据下标删除数据
	public void remove(int index){
		checkRange(index);
		Node temp = getNode(index);
		 
		if(temp != null){
			Node up = temp.previous;
			Node down = temp.next;
			
			//被删除的元素是第一个时
			if(index == 0){
				first = down;
			}
			
			//被删除的元素是最后一个时候
			if(index == size-1){
				last = up;
			}
			
			if(up!=null){
				up.next = down;
			}
			if(down!=null){
				down.previous = up;
			}
			size--;
		}
	}
	
	//根据下标获取节点（代码重用）
	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;
	}
	
	
	//[]
	//[a,b,c,d,e,f]  c-2
	public E get(int index){
		checkRange(index);
		Node temp = getNode(index);
		return (E) (temp !=null ? temp.element : null);
	}		
	
	//分装对索引的调用
	public void checkRange(int index){
		if(index <0 || index >size - 1){
			throw new RuntimeException("索引數字不合法："+index);
		}
	}
	
		
	@Override
	public String toString() {
		//[a,b,c] first=a, last=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<String>();
		
		list.add("a");
		list.add("b");
		list.add("c");
		list.add("d");
		list.add("e");
		list.add("f");
		
		//list.remove(5);
		//list.add(3,"老高");
		//list.add(0,"老陈");
		list.add(5,"凡凡");
		System.out.println(list);
		System.out.println(list.get(1));
	}	
		
		
}