leetcode的题目,设计链表(Java版)

今天leetcode通过的一道题,记录下Java链表的设计。代码都是自己敲的效率比较低,通过就行…

设计链表的实现。您可以选择使用单链表或双链表。单链表中的节点应该具有两个属性:val 和 next。val 是当前节点的值,next 是指向下一个节点的指针/引用。如果要使用双向链表,则还需要一个属性 prev 以指示链表中的上一个节点。假设链表中的所有节点都是 0-index 的。

在链表类中实现这些功能:

· get(index):获取链表中第 index 个节点的值。如果索引无效,则返回-1。
· addAtHead(val):在链表的第一个元素之前添加一个值为 val 的节点。插入后,新节点将成为链表的第一个节点。
· addAtTail(val):将值为 val 的节点追加到链表的最后一个元素。
· addAtIndex(index,val):在链表中的第index 个节点之前添加值为 val 的节点。如果 index 等于链表的长度,则该节点将附加到链表的末尾。如果 index大于链表长度,则不会插入节点。如果index小于0,则在头部插入节点。
· deleteAtIndex(index):如果索引 index有效,则删除链表中的第 index 个节点。

示例:

MyLinkedList linkedList = new MyLinkedList();
linkedList.addAtHead(1);
linkedList.addAtTail(3);
linkedList.addAtIndex(1,2); //链表变为1-> 2-> 3
linkedList.get(1); //返回2
linkedList.deleteAtIndex(1); //现在链表是1-> 3
linkedList.get(1); //返回3

代码我都运行在main函数中,所以这题之前需要先创建一个main函数来运行,接下来就按照标题一个一个得来把每个方法写好吧。

addAtHead (在表头插入node)

public class T11 {
    //新建一个main函数
    public static void main(String[] args) {
        MyLinkedList linkedList = new MyLinkedList();
        linkedList.addAtHead(1);
        //打印链表
        linkedList.listPrint();
    }
    static class MyLinkedList {
        class ListNode {
            int val;
            ListNode next;
            public ListNode(int val) {
                this.val = val;
            }
        }
        int size;
        ListNode head;

        /**
         * Initialize your data structure here.
         */
        public MyLinkedList() {
            this.size = 0;
            this.head = null;
        }
        public void addAtHead(int val) {
        	//这里注意判断空
            ListNode node = new MyLinkedList.ListNode(val);
            if (head == null) {
                head = node;
                return;
            }
            node.next = head;
            head = node;
        }
        //打印
        public void listPrint() {
            ListNode temp = head;
            while (temp != null) {
                System.out.print(temp.val);
                temp = temp.next;
            }
            System.out.println();
        }
    }

}

​​​​打印结果

"C:\Program Files\Java\jdk1.8.0_212\bin\java.exe" "-javaagent:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\lib\idea_rt.jar=52658:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\bin" -Dfile.encoding=UTF-8 -classpath "C:\Program Files\Java\jdk1.8.0_212\jre\lib\charsets.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\deploy.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\access-bridge-64.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\cldrdata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\dnsns.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jaccess.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jfxrt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\localedata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\nashorn.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunec.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunjce_provider.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunmscapi.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunpkcs11.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\zipfs.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\javaws.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jce.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfr.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfxswt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jsse.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\management-agent.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\plugin.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\resources.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\rt.jar;D:\ideaProject\study\out\production\study" com.company.T11
1

Process finished with exit code 0

addAtTail (在表尾插入数据Node)


public class T11 {
    //新建一个main函数
    public static void main(String[] args) {
        MyLinkedList linkedList = new MyLinkedList();
        linkedList.addAtHead(1);
        linkedList.addAtTail(3);
        //打印链表
        linkedList.listPrint();
    }
    static class MyLinkedList {

        class ListNode {
            int val;
            ListNode next;
            public ListNode(int val) {
                this.val = val;
            }
        }

        int size;
        ListNode head;

        /**
         * Initialize your data structure here.
         */
        public MyLinkedList() {
            this.size = 0;
            this.head = null;
        }

        public void addAtHead(int val) {
            ListNode node = new MyLinkedList.ListNode(val);
            //这里注意判断空
            if (head == null) {
                head = node;
                return;
            }
            node.next = head;
            head = node;
        }
        //链表表尾插入
        public void addAtTail(int val) {
            ListNode node = new ListNode(val);
            if (head == null) {
                head = node;
                return;
            }
            ListNode temp = head;
            int tag = 0;
            while (temp.next != null) {
                temp = temp.next;
                tag++;
//                System.out.println("tag = " + tag);
            }
            temp.next = node;
        }
        //打印
        public void listPrint() {
            ListNode temp = head;
            while (temp != null) {
                System.out.print(temp.val);
                temp = temp.next;
            }
            System.out.println();
        }
    }

}

打印结果:

"C:\Program Files\Java\jdk1.8.0_212\bin\java.exe" "-javaagent:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\lib\idea_rt.jar=50338:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\bin" -Dfile.encoding=UTF-8 -classpath "C:\Program Files\Java\jdk1.8.0_212\jre\lib\charsets.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\deploy.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\access-bridge-64.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\cldrdata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\dnsns.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jaccess.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jfxrt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\localedata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\nashorn.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunec.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunjce_provider.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunmscapi.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunpkcs11.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\zipfs.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\javaws.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jce.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfr.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfxswt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jsse.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\management-agent.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\plugin.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\resources.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\rt.jar;D:\ideaProject\study\out\production\study" com.company.T10
13

Process finished with exit code 0

addAtIndex (在指定index处插入数据)


public class T11 {
    //新建一个main函数
    public static void main(String[] args) {

        MyLinkedList linkedList = new MyLinkedList();
        linkedList.addAtHead(1);
        linkedList.addAtTail(3);
        linkedList.addAtIndex(1,2);   //链表变为1-> 2-> 3
        //打印链表
        linkedList.listPrint();
    }
    static class MyLinkedList {

        class ListNode {
            int val;
            ListNode next;

            public ListNode(int val) {
                this.val = val;
            }
        }

        int size;
        ListNode head;

        /**
         * Initialize your data structure here.
         */
        public MyLinkedList() {
            this.size = 0;
            this.head = null;
        }

        public void addAtHead(int val) {
            ListNode node = new MyLinkedList.ListNode(val);
            //这里注意判断空
            if (head == null) {
                head = node;
                return;
            }
            node.next = head;
            head = node;

        }

        //链表表尾插入
        public void addAtTail(int val) {
            ListNode node = new ListNode(val);
            if (head == null) {
                head = node;
                return;
            }
            ListNode temp = head;
            int tag = 0;
            while (temp.next != null) {
                temp = temp.next;
                tag++;

//                System.out.println("tag = " + tag);
            }
            temp.next = node;
        }

//        addAtIndex(index,val):
//        在链表中的第index个节点之前添加值为val 的节点。
//        如果index等于链表的长度,则该节点将附加到链表的末尾。
//        如果 index 大于链表长度,则不会插入节点。
//        如果index小于0,则在头部插入节点。

        public void addAtIndex(int index, int val) {
            ListNode node = new ListNode(val);
            ListNode temp = head;

            if (index <= 0) {
                //直接在头部插入
                node.next = head;
                head = node;
                return;
            }

            //链表不止只有一个节点
            int tag = 0;
            while (temp != null) {
                if (tag == index - 1) {
                    ListNode ln = temp.next;
                    temp.next = node;
                    node.next = ln;
                    return;
                }
                temp = temp.next;
                tag++;
            }
            if (index > tag) {
                System.out.println("index 超出范围");
            }
        }
        
        //打印
        public void listPrint() {
            ListNode temp = head;
            while (temp != null) {
                System.out.print(temp.val);
                temp = temp.next;
            }
            System.out.println();
        }
    }

}

打印结果:

"C:\Program Files\Java\jdk1.8.0_212\bin\java.exe" "-javaagent:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\lib\idea_rt.jar=61549:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\bin" -Dfile.encoding=UTF-8 -classpath "C:\Program Files\Java\jdk1.8.0_212\jre\lib\charsets.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\deploy.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\access-bridge-64.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\cldrdata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\dnsns.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jaccess.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jfxrt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\localedata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\nashorn.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunec.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunjce_provider.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunmscapi.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunpkcs11.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\zipfs.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\javaws.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jce.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfr.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfxswt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jsse.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\management-agent.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\plugin.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\resources.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\rt.jar;D:\ideaProject\study\out\production\study" com.company.T11
123

Process finished with exit code 0

get(获取index位置上的链表中的值,如果输入的index超出范围则返回-1)


public class T11 {
    //新建一个main函数
    public static void main(String[] args) {

        MyLinkedList linkedList = new MyLinkedList();
        linkedList.addAtHead(1);
        linkedList.addAtTail(3);
        linkedList.addAtIndex(1,2);   //链表变为1-> 2-> 3
        linkedList.get(1);            //返回2
        //打印链表
        linkedList.listPrint();
    }
    static class MyLinkedList {

        class ListNode {
            int val;
            ListNode next;

            public ListNode(int val) {
                this.val = val;
            }
        }

        int size;
        ListNode head;

        /**
         * Initialize your data structure here.
         */
        public MyLinkedList() {
            this.size = 0;
            this.head = null;
        }

        public void addAtHead(int val) {
            ListNode node = new MyLinkedList.ListNode(val);
            //这里注意判断空
            if (head == null) {
                head = node;
                return;
            }
            node.next = head;
            head = node;

        }

        //链表表尾插入
        public void addAtTail(int val) {
            ListNode node = new ListNode(val);
            if (head == null) {
                head = node;
                return;
            }
            ListNode temp = head;
            int tag = 0;
            while (temp.next != null) {
                temp = temp.next;
                tag++;

//                System.out.println("tag = " + tag);
            }
            temp.next = node;
        }

//        addAtIndex(index,val):
//        在链表中的第index个节点之前添加值为val 的节点。
//        如果index等于链表的长度,则该节点将附加到链表的末尾。
//        如果 index 大于链表长度,则不会插入节点。
//        如果index小于0,则在头部插入节点。

        public void addAtIndex(int index, int val) {
            ListNode node = new ListNode(val);
            ListNode temp = head;

            if (index <= 0) {
                //直接在头部插入
                node.next = head;
                head = node;
                return;
            }

            //链表不止只有一个节点
            int tag = 0;
            while (temp != null) {
                if (tag == index - 1) {
                    ListNode ln = temp.next;
                    temp.next = node;
                    node.next = ln;
                    return;
                }
                temp = temp.next;
                tag++;
            }
            if (index > tag) {
                System.out.println("index 超出范围");
            }
        }

        public int get(int index) {
            if (head == null){
                return -1;
            }
            ListNode temp = head;
            int tag = 0;
            int value = -1;
            while(temp != null){
                if(tag == index){
                    value = temp.val;
                    System.out.println("value = "+value);
                    return value;
                }
                temp = temp.next;
                tag++;
            }
            System.out.println("value = "+value);
            return value;
        }
        //打印
        public void listPrint() {
            ListNode temp = head;
            while (temp != null) {
                System.out.print(temp.val);
                temp = temp.next;
            }
            System.out.println();
        }
    }

}

deleteAtIndex (删除链表指定位置上的index)

        public void deleteAtIndex(int index) {
            ListNode temp = head;
            if (index == 0) {
                //直接在头部插入
                head = temp.next;
                return;
            }
            int tag = 0;
            ListNode slowtemp = temp;
            while (temp != null) {

                if (tag == index) {
                    slowtemp.next = temp.next;
                    return;
                }else {
                    slowtemp = temp;
                }
                temp = temp.next;
                tag++;
            }
            if (index >= tag) {
                System.out.println("index 超出范围");
            }
        }

最后附上完整的链表代码。


public class T11 {
    //新建一个main函数
    public static void main(String[] args) {
        MyLinkedList linkedList = new MyLinkedList();
        linkedList.addAtHead(1);
        linkedList.addAtTail(3);
        linkedList.addAtIndex(1,2);   //链表变为1-> 2-> 3
        linkedList.listPrint();
        linkedList.get(1);            //返回2
        linkedList.deleteAtIndex(1);  //现在链表是1-> 3
        linkedList.listPrint();
        linkedList.get(1);            //返回3
    }
    static class MyLinkedList {

        class ListNode {
            int val;
            ListNode next;

            public ListNode(int val) {
                this.val = val;
            }
        }

        int size;
        ListNode head;

        /**
         * Initialize your data structure here.
         */
        public MyLinkedList() {
            this.size = 0;
            this.head = null;
        }

        public void addAtHead(int val) {
            ListNode node = new MyLinkedList.ListNode(val);
            //这里注意判断空
            if (head == null) {
                head = node;
                return;
            }
            node.next = head;
            head = node;

        }

        //链表表尾插入
        public void addAtTail(int val) {
            ListNode node = new ListNode(val);
            if (head == null) {
                head = node;
                return;
            }
            ListNode temp = head;
            int tag = 0;
            while (temp.next != null) {
                temp = temp.next;
                tag++;

//                System.out.println("tag = " + tag);
            }
            temp.next = node;
        }

//        addAtIndex(index,val):
//        在链表中的第index个节点之前添加值为val 的节点。
//        如果index等于链表的长度,则该节点将附加到链表的末尾。
//        如果 index 大于链表长度,则不会插入节点。
//        如果index小于0,则在头部插入节点。

        public void addAtIndex(int index, int val) {
            ListNode node = new ListNode(val);
            ListNode temp = head;

            if (index <= 0) {
                //直接在头部插入
                node.next = head;
                head = node;
                return;
            }

            //链表不止只有一个节点
            int tag = 0;
            while (temp != null) {
                if (tag == index - 1) {
                    ListNode ln = temp.next;
                    temp.next = node;
                    node.next = ln;
                    return;
                }
                temp = temp.next;
                tag++;
            }
            if (index > tag) {
                System.out.println("index 超出范围");
            }
        }

        public int get(int index) {
            if (head == null){
                return -1;
            }
            ListNode temp = head;
            int tag = 0;
            int value = -1;
            while(temp != null){
                if(tag == index){
                    value = temp.val;
                    System.out.println("value = "+value);
                    return value;
                }
                temp = temp.next;
                tag++;
            }
            System.out.println("value = "+value);
            return value;
        }

        public void deleteAtIndex(int index) {
            ListNode temp = head;
            if (index == 0) {
                //直接在头部插入
                head = temp.next;
                return;
            }
            int tag = 0;
            ListNode slowtemp = temp;
            while (temp != null) {

                if (tag == index) {
                    slowtemp.next = temp.next;
                    return;
                }else {
                    slowtemp = temp;
                }
                temp = temp.next;
                tag++;
            }
            if (index >= tag) {
                System.out.println("index 超出范围");
            }
        }

        //打印
        public void listPrint() {
            ListNode temp = head;
            while (temp != null) {
                System.out.print(temp.val);
                temp = temp.next;
            }
            System.out.println();
        }
    }

}

打印结果:

"C:\Program Files\Java\jdk1.8.0_212\bin\java.exe" "-javaagent:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\lib\idea_rt.jar=54244:D:\Program Files\JetBrains\IntelliJ IDEA 2020.3.3\bin" -Dfile.encoding=UTF-8 -classpath "C:\Program Files\Java\jdk1.8.0_212\jre\lib\charsets.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\deploy.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\access-bridge-64.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\cldrdata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\dnsns.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jaccess.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\jfxrt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\localedata.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\nashorn.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunec.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunjce_provider.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunmscapi.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\sunpkcs11.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\ext\zipfs.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\javaws.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jce.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfr.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jfxswt.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\jsse.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\management-agent.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\plugin.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\resources.jar;C:\Program Files\Java\jdk1.8.0_212\jre\lib\rt.jar;D:\ideaProject\study\out\production\study" com.company.T11
123
value = 2
13
value = 3

Process finished with exit code 0

这是今天刷leetcode的总结,效率虽然不是最高的,不过还是能用的,作为参考用来记录方便之后写题能用到~

--------------------------------这是链表题目的链接:设计链表-----------------------------

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值