您好,登錄后才能下訂單哦!
本文實(shí)例為大家分享了Java實(shí)現(xiàn)單向鏈表反轉(zhuǎn)的具體代碼,供大家參考,具體內(nèi)容如下
1、實(shí)現(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; } }
2、實(shí)現(xiàn)思路
遞歸:從尾部開始處理
非遞歸:從頭部開始處理
以上就是本文的全部?jī)?nèi)容,希望對(duì)大家的學(xué)習(xí)有所幫助,也希望大家多多支持億速云。
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。