zoukankan      html  css  js  c++  java
  • 单链表逆序

    https://blog.csdn.net/autumn20080101/article/details/7607148

    package com.jd.etms.vrs.lean.link;
    
    /**
     * Created by zhangwenjun10 on 2018/11/26.
     */
    public class TestLink {
        public static void main(String args[]) {
    
            LinkNode headNode = creatSingleLink();
            printSingleLink(headNode);
            LinkNode temNode = reverseSingleLink(headNode);
            System.out.println();
            printSingleLink(temNode);
    
            LinkNode reverseNode = reverseLink(temNode);
            System.out.println();
            printSingleLink(reverseNode);
    
        }
    
        public static LinkNode creatSingleLink() {
    
            LinkNode headNode = new LinkNode(0);
            headNode.next = new LinkNode(1);
            headNode.next.next = new LinkNode(2);
            headNode.next.next.next = new LinkNode(3);
            headNode.next.next.next.next = new LinkNode(4);
            headNode.next.next.next.next.next = new LinkNode(5);
    
            return headNode;
        }
    
        public static void printSingleLink(LinkNode headNode) {
            if (headNode != null) {
                System.out.print("" + headNode.value);
            }
            if (null != headNode.next) {
                printSingleLink(headNode.next);
            }
        }
    
        /*单链表逆序*/
        public static LinkNode reverseSingleLink(LinkNode headNode) {
            if (null == headNode || null == headNode.next) {
                return headNode;
            } else {
                LinkNode temNode = headNode.next;
                LinkNode newHead = reverseSingleLink(temNode);
                headNode.next.next = headNode;
                headNode.next = null;
                return newHead;
            }
        }
    
        public static LinkNode reverseLink(LinkNode head){
            if(head == null || head.next == null){
                return head;
            }
            LinkNode prev = null;
            LinkNode next = null;
            while (head != null){
                next = head.next;
                head.next = prev;
                prev = head;
                head = next;
            }
    
            return prev;
        }
    
    }
  • 相关阅读:
    用命令行执行ROBOT FRAMEWORK
    RF ---library
    RF--- selenium
    RIDE指定log和report的输出目录
    robotframework运行时后台报错UnicodeDecodeError
    rf-demos (request)
    RobotFramework --RIDE介绍
    基于RFS(robot framework selenium)框架模拟POST/GET请求执行自动化接口测试
    volatile非原子性示例
    wait()方法写在while循环中可以在线程接到通知后再一次判断条件
  • 原文地址:https://www.cnblogs.com/junge/p/10021312.html
Copyright © 2011-2022 走看看