轉(zhuǎn)載自：http://poly.iteye.com/blog/1748272

主要是面試中可能會(huì)經(jīng)常碰上該類似操作，尤其是稍大點(diǎn)公司，面試官可能并不在乎你能不能搞定該題，但是這類型題目最是能體現(xiàn)程序員的思維狀態(tài) ---一個(gè)迷糊頭腦的程序員 怎能立志改變這個(gè)世界。

/*** @author luochengcheng* 定義一個(gè)單鏈表*/ class Node {//變量private int record;//指向下一個(gè)對(duì)象private Node nextNode;public Node(int record) {super();this.record = record;}public int getRecord() {return record;}public void setRecord(int record) {this.record = record;}public Node getNextNode() {return nextNode;}public void setNextNode(Node nextNode) {this.nextNode = nextNode;} }/*** @author luochengcheng* 兩種方式實(shí)現(xiàn)單鏈表的反轉(zhuǎn)(遞歸、普通)* 新手強(qiáng)烈建議旁邊拿著紙和筆跟著代碼畫圖(便于理解)*/ public class ReverseSingleList {/** * 遞歸，在反轉(zhuǎn)當(dāng)前節(jié)點(diǎn)之前先反轉(zhuǎn)后續(xù)節(jié)點(diǎn) */public static Node reverse(Node head) {if (null == head || null == head.getNextNode()) {return head;}Node reversedHead = reverse(head.getNextNode());head.getNextNode().setNextNode(head);head.setNextNode(null);return reversedHead;}/** * 遍歷，將當(dāng)前節(jié)點(diǎn)的下一個(gè)節(jié)點(diǎn)緩存后更改當(dāng)前節(jié)點(diǎn)指針 * */public static Node reverse2(Node head) {if (null == head) {return head;}Node pre = head;Node cur = head.getNextNode();Node next;while (null != cur) {next = cur.getNextNode();cur.setNextNode(pre);pre = cur;cur = next;}//將原鏈表的頭節(jié)點(diǎn)的下一個(gè)節(jié)點(diǎn)置為null，再將反轉(zhuǎn)后的頭節(jié)點(diǎn)賦給head head.setNextNode(null);head = pre;return head;}public static void main(String[] args) {Node head = new Node(0);Node tmp = null;Node cur = null;// 構(gòu)造一個(gè)長(zhǎng)度為10的鏈表，保存頭節(jié)點(diǎn)對(duì)象head for (int i = 1; i < 10; i++) {tmp = new Node(i);if (1 == i) {head.setNextNode(tmp);} else {cur.setNextNode(tmp);}cur = tmp;}//打印反轉(zhuǎn)前的鏈表Node h = head;while (null != h) {System.out.print(h.getRecord() + " ");h = h.getNextNode();}//調(diào)用反轉(zhuǎn)方法head = reverse2(head);System.out.println("\n**************************");//打印反轉(zhuǎn)后的結(jié)果while (null != head) {System.out.print(head.getRecord() + " ");head = head.getNextNode();}} }

總結(jié)

以上是生活随笔為你收集整理的Java反转单链表(code)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。