Java實現單向鏈表反轉

來源:互聯網
上載者:User

標籤:stat   eve   int   code   lin   ==   null   val   rate   

環境:

Java: jdk1.8.0_91

public class LinkedListTest {    public static void main(String[] args) {        Node A = new Node("A");        Node B = new Node("B");        Node C = new Node("C");        Node D = new Node("D");        Node E = new Node("E");        Node F = new Node("F");        A.next = B;        B.next = C;        C.next = D;        D.next = E;        E.next = F;        print(A);        LinkedListReversor reversor = LinkedListReversor.RECURSION;        System.out.println(reversor.getStrategy() + ":");        Node tmp = reversor.execute(A);        print(tmp);        reversor = LinkedListReversor.NO_RECURSION;        System.out.println(reversor.getStrategy() + ":");        print(reversor.execute(tmp));    }    private static void print(Node node) {        while (node != null) {            System.out.print(node.value);            node = node.next;            if (node != null) {                System.out.print("->");            } else {                System.out.println();            }        }    }}class Node {    public String value;    public Node next;    public Node(String value) {        this.value = value;    }}enum LinkedListReversor {    RECURSION("遞迴") {        @Override        public Node execute(Node node) {            Node prev = null;            if (node == null || node.next == null) {                prev = node;            } else {                Node tmp = execute(node.next);                node.next.next = node;                node.next = null;                prev = tmp;            }            return prev;        }    },    NO_RECURSION("非遞迴") {        @Override        public Node execute(Node node) {            Node prev = null;            while (node != null) {                Node tmp = node;                node = node.next;                tmp.next = prev;                prev = tmp;            }            return prev;        }    };    private String strategy;    private LinkedListReversor(String strategy) {        this.strategy = strategy;    }    public abstract Node execute(Node node);    public String getStrategy() {        return strategy;    }}

 

Java實現單向鏈表反轉

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.