博客
关于我
九章基础算法01:链表
阅读量:261 次
发布时间:2019-03-01

本文共 2697 字,大约阅读时间需要 8 分钟。

????

????

??????????????????????????????????????????????????????????????????????????????????????

????

  • ????

    ???????????Node???????????????

    • ????Data???????????????
    • ???Pointer??????????null?????????????
  • ??????

    ????????????????????????????????????????????????????????????


  • Dummy????

    ?????????????dummy?????????

    Dummy?????

  • ??????

    ??dummy???????????????????????????????????

  • ?????

    • ?????dummy?????????????????????????
    • ??????????dummy????????
  • ??????

    • ???????dummy???next??null???????????

  • ??????

    ??????

    class ListNode {
    public int val;
    public ListNode next;
    public ListNode(int value) {
    val = value;
    }
    }
    • ?????
      ??????next?????null?

    ????

    public class LinkedList {
    private ListNode dummy;
    public LinkedList() {
    dummy = new ListNode(-1);
    }
    }
    • ????
      ?????dummy??????????????????

    ??????

    1. ????

    public void add(int location, int val) {
    ListNode pre = dummy;
    for (int i = 0; i < location; i++) {
    pre = pre.next;
    }
    ListNode node = new ListNode(val);
    node.next = pre.next;
    pre.next = node;
    }
    • ????
      ???0?????????????????????

    2. ????

    public void remove(int location) {
    ListNode pre = dummy;
    for (int i = 0; i < location; i++) {
    pre = pre.next;
    }
    pre.next = pre.next.next;
    }
    • ????
      ???????????????next????????

    3. ????

    public int get(int location) {
    ListNode cur = dummy.next;
    for (int i = 0; i < location; i++) {
    cur = cur.next;
    }
    return cur.val;
    }
    • ????
      ?????????????????

    4. ????

    public boolean contain(int val) {
    ListNode cur = dummy.next;
    while (cur != null) {
    if (cur.val == val) {
    return true;
    }
    cur = cur.next;
    }
    return false;
    }
    • ????
      ?dummy??????????????????????????

    5. ????

    public void print() {
    ListNode cur = dummy.next;
    while (cur != null) {
    System.out.print(cur.val + "->");
    cur = cur.next;
    }
    System.out.println("null");
    }
    • ????
      ????????????null????????

    ????

    public static void main(String[] args) {
    LinkedList list = new LinkedList();
    list.add(0, 10);
    list.add(1, 20);
    list.add(2, 40);
    list.remove(1);
    list.print();
    System.out.println(list.get(0));
    System.out.println(list.get(1));
    System.out.println(list.contain(50));
    System.out.println(list.contain(40));
    }
    • ????
      ?????????????????????

    ArrayList?LinkedList???????

    ???? ArrayList LinkedList ?????
    ???add? O(n) O(n) ????????????
    ???remove? O(n) O(n) ??????
    ???get? O(1) O(n) ArrayList????
    ???contain? O(n) O(n) ???????

    LeetCode????

    ????

    • Solution???

      LeetCode????Solution??????????????????

    • ??????

      ??main???????????????????

    ????

  • ????????aplusb??
  • ???????????
  • ???????????

  • ??

    ?????????????????????????????????????????????????

    转载地址:http://ahwx.baihongyu.com/

    你可能感兴趣的文章
    Netty工作笔记0020---Selectionkey在NIO体系
    查看>>
    Vue踩坑笔记 - 关于vue静态资源引入的问题
    查看>>
    Netty工作笔记0025---SocketChannel API
    查看>>
    Netty工作笔记0027---NIO 网络编程应用--群聊系统2--服务器编写2
    查看>>
    Netty工作笔记0050---Netty核心模块1
    查看>>
    Netty工作笔记0057---Netty群聊系统服务端
    查看>>
    Netty工作笔记0060---Tcp长连接和短连接_Http长连接和短连接_UDP长连接和短连接
    查看>>
    Netty工作笔记0063---WebSocket长连接开发2
    查看>>
    Netty工作笔记0070---Protobuf使用案例Codec使用
    查看>>
    Netty工作笔记0077---handler链调用机制实例4
    查看>>
    Netty工作笔记0084---通过自定义协议解决粘包拆包问题2
    查看>>
    Netty工作笔记0085---TCP粘包拆包内容梳理
    查看>>
    Netty常用组件一
    查看>>
    Netty常见组件二
    查看>>
    netty底层源码探究:启动流程;EventLoop中的selector、线程、任务队列;监听处理accept、read事件流程;
    查看>>
    Netty心跳检测机制
    查看>>
    Netty核心模块组件
    查看>>
    Netty框架内的宝藏:ByteBuf
    查看>>
    Netty框架的服务端开发中创建EventLoopGroup对象时线程数量源码解析
    查看>>
    Netty源码—2.Reactor线程模型一
    查看>>