单向链表取指定节点

2019独角兽企业重金招聘Python工程师标准>>>

package com.weshare.eel.task.utils;

public class Node {
    private int nodeValue;

    private Node nextNode;

    public int getNodeValue() {
        return nodeValue;
    }

    public void setNodeValue(int nodeValue) {
        this.nodeValue = nodeValue;
    }

    public Node getNextNode() {
        return nextNode;
    }

    public void setNextNode(Node nextNode) {
        this.nextNode = nextNode;
    }

    public Node(int nodeValue) {
        this.nodeValue = nodeValue;
    }
}

package com.weshare.eel.task.utils;

public class LinkNode {
    private Node head = null;
    private Node tail = null;
    private int len = 0;


    public void addNode(int value) {
        Node newNode = new Node(value);

        // 单链表长度
        len += 1;

        // 为节点设置
        tail = newNode;

        // 头结点为空的场合直接设置
        if (null == head) {
            head = newNode;
            return;
        }

        // 临时节点
        Node temp = head;

        while (temp.getNextNode() != null) {
            temp = temp.getNextNode();
        }

        temp.setNextNode(newNode);
    }

    public Node getHead() {
        return head;
    }

    public Node getTail() {
        return tail;
    }

    public int getLen() {
        return len;
    }
}

package com.weshare.eel.task.utils;

import java.util.List;

public class Test01 {
    public static void main(String[] args) {
        LinkNode linkNode = new LinkNode();
        for (int i = 1; i <= 100; i++) {
            linkNode.addNode(i);
        }

        int len = linkNode.getLen();
        System.out.println(len);
        Node head = linkNode.getHead();

        int lentemp = 1;
        Node tempNode = head;
        while (tempNode.getNextNode() != null) {
            lentemp++;
            tempNode = tempNode.getNextNode();
        }
        System.out.println(lentemp);

        int tailk = lentemp - 2 + 1;
        int temp = 1;
        Node tailkNode = head;

        while (tailkNode.getNextNode() != null) {
            if (temp == tailk) {
                break;
            }
            temp++;

            tailkNode = tailkNode.getNextNode();
        }

        System.out.println(tailkNode.getNodeValue());
    }
}

 

转载于:https://my.oschina.net/u/3824443/blog/2874442