package com.ckw.mianshi;

/**

* java 實現(xiàn)單鏈表的逆序

* @author Administrator

*

*/

public class SingleLinkedReverse {

class Node{

int data;

Node next;

public Node(int data){

this.data = data;

}

}

public static void main(String[] args) {

SingleLinkedReverse slr = new SingleLinkedReverse();

Node head, tail;

head = tail = slr.new Node(0);

for(int i=1; i<10; i++){

Node p = slr.new Node(i);

tail.next = p;

tail = p;

}

tail = head;

while(tail != null){

System.out.print(tail.data+" ");

tail = tail.next;

}

head = reverse(head);

System.out.println(" ");

while(head != null){

System.out.print(head.data+" ");

head = head.next;

}

}

private static Node reverse(Node head) {

Node p1,p2 = null;

p1 = head;

while(head.next != null){

p2 = head.next;

head.next = p2.next;

p2.next = p1;

p1 = p2;

}

return p2;

}

}

測試結(jié)果：

0 ?1 ?2 ?3 ?4 ?5 ?6 ?7 ?8 ?9

9 ?8 ?7 ?6 ?5 ?4 ?3 ?2 ?1 ?0

版權(quán)聲明：本文為博主原創(chuàng)文章，未經(jīng)博主允許不得轉(zhuǎn)載。

原文：http://blog.csdn.net/u012571415/article/details/46955535

總結(jié)

以上是生活随笔為你收集整理的单链表的逆序java_java 实现单链表的逆序的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

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