데이터 구조 - 자바 구현 싱글 체인 시트

//               
class Node {
	Node next = null;
	int data;
	public Node(int data) {
		this.data = data ;
	}
}

import java.util.Hashtable;
public class MyLinkedList {
	Node head = null;//      
	/**        
	 * @param d:       
	 */
    public void addNode(int d) {
    	Node newNode = new Node(d);
    	if(head==null) {
    		head = newNode;
    		return;
    	}
		Node tmp = head;
		while(tmp.next != null) {
			tmp = tmp.next;
		}
		//add node to end
		tmp.next = newNode;
	}
    /**
     * @param index:    index   
     * @return     true，    false
     */
    public Boolean deleteNode(int index) {
    	//        
    	if(index<1 || index>length()) {
    		return false;
    	}
    	if(index==1) {
    		head = head.next;
    		return true;
    	}
    	int i=2;
    	Node preNode = head;
    	Node curNode = preNode.next;
    	while(curNode!=null) {
    		if(i == index) {
    			preNode.next = curNode.next;
    			return true;
    		}
    		preNode = curNode;
    		curNode = curNode.next;
    		i++;
    	}
    	return true;
    }
    /**
     * @return        
     */
    public int length() {
    	int length = 0;
    	Node tmp = head;
    	while(tmp != null) {
    		length ++;
    		tmp = tmp.next;
    	}
    	return length;
    }
    /**       
     * @return          
     */
    public Node orderList() {
    	Node nextNode= null;
    	int temp = 0;
    	Node curNode = head;
    	while(curNode.next != null) {
    		nextNode = curNode.next;
    		while(nextNode != null) {
    			if(curNode.data > nextNode.data) {
    				temp = curNode.data;
    				curNode.data = nextNode.data;
    				nextNode.data = temp;
    			}
    			nextNode = nextNode.next;
    		}
    		curNode = curNode.next;
    	}
    	return head;
    }
    /**        data
     * 
     */
    public void printList() {
    	Node temp = head;
    	while( temp != null) {
    		System.out.println(temp.data);
    		temp = temp.next;
    	}
    }
}

    /**  
     * @param k:   k   
     */
    public Node findElem(Node head,int k) {
    	if(k<1) {
    		return null;
    	}
    	Node p1 = head;
    	Node p2 = head;
    	for(int i=0;i

    //          
    public Node searchMid(Node head) {
    	Node p = this.head;
    	Node q = this.head;
    	while(p!=null && p.next!=null && p.next.next!=null) {
    		p=p.next.next;
    		q=q.next;
    	}
    	return q;
    }

    //    
    public void reverse(Node head) {
    	Node pReverseHead = head;
    	Node pNode = head;
    	Node pPre = null;
    	while(pNode!=null) {
    		Node pNext = pNode.next;
    		if(pNext == null) {
    			pReverseHead = pNode;//                 ,  next null
    		}
    		pNode.next = pPre;
    		pPre = pNode;
    		pNode = pNext;
    	}
    	this.head = pReverseHead;
    }

    //  
    public void printListReverse(Node pListHead) {
    	if(pListHead != null) {
    		printListReverse(pListHead.next);
    		System.out.println(pListHead.data);
    	}
    }

    //      
    public boolean deleteNode(Node n) {
    	//            ,            next  null
    	if(n == null || n.next == null) {
    		return false;
    	}
    	//     
    	//           
    	int temp =n.data;
    	n.data = n.next.data;
    	n.next.data = temp;
    	//         
    	n.next = n.next.next;
    	return true;
    	
    }

 /**      
     * 
     */
	//     ,       ,         
    public void deleteDuplecate1(Node head) {
    	Hashtable table = new Hashtable();
    	Node temp = head;
    	Node pre = null;
    	while(temp != null) {
    		if(table.containsKey(temp.data)) {
    			pre.next = temp.next;
    		}else {
    			table.put(temp.data, 1);//      
    			pre = temp;
    		}
    		temp = temp.next;
    	}
    }
    //       ,          
    public void deleteDuplecate2(Node head) {
    	Node p = head;
    	while(p != null) {
    		Node q = p;
    		while(q.next != null) {
    			if(p.data == q.next.data) {
    				q.next = q.next.next;
    			}else {
    				q = q.next;
    			}
    			p = p.next;
    		}
    	}
    }