有序鏈表--Java實現

/*有序鏈表--使用的是單鏈表實現
 *在插入的時候保持按照值順序排列
 *對於刪除最小值的節點效率最高--適合頻繁的刪除最小的節點
 * */
public class MySortedLinkList {
    public Link first;
    
    public MySortedLinkList() {
        first = null;
    }
    
    public boolean isEmpty(){
        return first == null;
    }
    
    public void insert(int key){
        Link newLink = new Link(key);
        Link previous = null;
        Link current = first;
        while(current != null && key > current.id){ //找下個節點
            previous = current;
            current = current.next;
        }
        //比當前節點值小，剛好插入當前節點前面
        if(previous == null){//鏈表是空的
            first = newLink;
        }
        else{
            previous.next = newLink;
        }
        newLink.next = current;
    }
    
    public Link remove(){
        Link temp = first;
        first = first.next;
        return temp;
    }
    
    public void displayLinkedList(){//順鏈從小到大
        System.out.println("sorted linkedlist---small--to--big");
        Link current = first;
        while(current!= null ){
            current.diaplayLink();
            System.out.print("");
            current = current.next;
        }
        System.out.println();
    }




    public static void main(String[] args) {
        
        MySortedLinkList sortlist = new MySortedLinkList();
        
        sortlist.insert(7);
        sortlist.insert(6);
        sortlist.insert(9);
        
        sortlist.displayLinkedList();
    }

}