zoukankan      html  css  js  c++  java
  • [数据结构]手动实现单链表

    package com.darrenchan;
    
    public class MyList {
        /**
         * 插入(头插法)
         */
        public static void headInsert(ListNode head, ListNode newhead){
            ListNode old = head;
            head = newhead;
            head.next = old;
        }
        /**
         * 插入(尾插法)
         */
        public static void tailInsert(ListNode tail, ListNode newtail){
            ListNode old = tail;
            tail = newtail;
            tail.next = null;
            old.next = tail;
        }
        /**
         * 遍历查找
         */
        public static int find(ListNode head, int value){
            int index = -1;
            int count = 0;
            while(head != null){
                if(head.value == value){
                    index = count;
                    return index;
                }
                head = head.next;
                count++;
            }
            return index;
        }
        /**
         * 插入节点(p后面插入s)
         */
        public static void insert(ListNode p, ListNode s){
            ListNode next = p.next;
            p.next = s;
            s.next = next;
        }
    
        /**
         * 删除节点
         */
        public static void delete(ListNode head, ListNode q){
            if(q != null && q.next != null){
                ListNode p = q.next;
                q.value = p.value;
                //删除q.next
                q.next = p.next;
                p = null;
            }
         //处理删除最后一个元素的情况
    if(q.next == null){ while(head != null){ if(head.next != null && head.next == q){ head.next = null; break; } head = head.next; } } } public static void main(String[] args) { ListNode node1 = new ListNode(1); ListNode node2 = new ListNode(2); ListNode node3 = new ListNode(3); node1.next = node2; node2.next = node3; node3.next = null; traverse(node1); ListNode newhead = new ListNode(0); headInsert(node1, newhead); traverse(newhead); ListNode newtail = new ListNode(4); tailInsert(node3, newtail); traverse(newhead); System.out.println(find(newhead, 4)); ListNode node = new ListNode(5); insert(newtail, node); traverse(newhead); delete(newhead, node3); traverse(newhead); } /** * 遍历 */ public static void traverse(ListNode head){ while(head != null){ System.out.print(head.value + " "); head = head.next; } System.out.println(); } }

  • 相关阅读:
    【学习笔记】斯特林数(未完成)
    【题解/学习笔记】点分树
    【题解】[国家集训队] Crash 的文明世界
    【题解】SP34096 DIVCNTK
    【题解】Loj6053 简单的函数
    【题解】[ZJOI2012]网络
    【题解】bzoj3252 攻略
    【题解】[POI2014]HOT-Hotels 加强版
    IDEA文件夹变红,轻松删除SVN版本控制关联
    配置dataguard broker并主从切换
  • 原文地址:https://www.cnblogs.com/DarrenChan/p/9535540.html
Copyright © 2011-2022 走看看