zoukankan      html  css  js  c++  java
  • java学习之—链表(2)

    /**
     * 双端链表操作
     * Create by Administrator
     * 2018/6/14 0014
     * 下午 2:05
     **/
    class Link1 {
    
        public long dData;
        public Link1 next;
    
        public Link1(int id) {
            this.dData = id;
        }
    
        public void displayLink() {
            System.out.print(dData + " ");
        }
    }
    
    public class FirstLastList {
    
        private Link1 first;
        private Link1 last;
    
        public FirstLastList() {
            this.first = null;
            this.last = null;
        }
    
        public boolean isEmpty(){           //判断链表是否为空
            return (first == null);
        }
    
        public long deleteFirst(){
            long temp = first.dData;
            if(first.next == null){
                last = null;
            }
            first = first.next;
            return temp;
        }
    
        public void insertFirst(int id){
            Link1 link = new Link1(id);
            if(isEmpty()){
                last = link;
            }
            link.next = first;          //储存对象的引用
            first = link;               //把当前对象赋值给first
        }
    
        public void  insertLast(int id){
            Link1 newLink = new Link1(id);
            if (isEmpty()){
                first = newLink;
            }else {
                last.next = newLink;
            }
            last = newLink;
        }
    
        public void displayList(){
            System.out.print("List (first-->last): ");
            Link1 current = first;
            while(current != null){
                current.displayLink();
                current = current.next;
            }
            System.out.println("");
        }
    
        public static void main(String[] args) {
            FirstLastList theList = new FirstLastList();
    
            theList.insertFirst(22);
            theList.insertFirst(44);
            theList.insertFirst(66);
    
            theList.insertLast(11);
            theList.insertLast(33);
            theList.insertLast(55);
    
            theList.displayList();
    
            theList.deleteFirst();
            theList.deleteFirst();
    
            theList.displayList();
        }
    }
    

      

  • 相关阅读:
    python基础知识0-5(单双向队列)
    python基础知识0-4
    python函数篇0-1
    面试题17:合并两个排序的链表
    面试题16:反转链表
    面试题15:链表中倒数第k个结点
    面试题14:调整数组顺序使奇数位于偶数前面
    面试题13:在O(1)时间删除链表结点
    面试题12:打印1到最大的n位数
    面试题11:数值的整数次方
  • 原文地址:https://www.cnblogs.com/chancy/p/9186167.html
Copyright © 2011-2022 走看看