手动实现LinkedList ，get查询，节点遍历 (2)

 

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;

public class SxtLinkedList02 {


	private Node first;
	private Node last;
	
	private int size;
	
	//[]
	//['a','b','c']
	public void add(Object obj){
		Node node = new Node(obj);
		
		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++;
	}			
	
	//[]
	//[a,b,c,d,e,f]  c-2
	public Object get(int index){
		
		if(index <0 || index >size - 1){
			throw new RuntimeException("索引數字不合法："+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.element;
	}			
		
	@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) {
		SxtLinkedList02 list = new SxtLinkedList02();
		
		list.add("a");
		list.add("b");
		list.add("c");
		list.add("d");
		list.add("e");
		list.add("f");
		
		System.out.println(list);
		System.out.println(list.get(5));
	}	
		
		
}