本文實例為大家分享了Java實現(xiàn)單向鏈表反轉(zhuǎn)的具體代碼,供大家參考,具體內(nèi)容如下
創(chuàng)新互聯(lián)專業(yè)成都做網(wǎng)站、成都網(wǎng)站建設(shè),集網(wǎng)站策劃、網(wǎng)站設(shè)計、網(wǎng)站制作于一體,網(wǎng)站seo、網(wǎng)站優(yōu)化、網(wǎng)站營銷、軟文營銷等專業(yè)人才根據(jù)搜索規(guī)律編程設(shè)計,讓網(wǎng)站在運行后,在搜索中有好的表現(xiàn),專業(yè)設(shè)計制作為您帶來效益的網(wǎng)站!讓網(wǎng)站建設(shè)為您創(chuàng)造效益。1、實現(xiàn)代碼
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; } }