链表的正逆序打印 java语言实现

来源：互联网发布：类似p2p的软件编辑：程序博客网时间：2024/05/01 09:00

import java.util.LinkedList;public class ListPrint {public static void main(String args[]){LinkedList list=new LinkedList();list.add("china");list.add("sina");list.add("I");list.add("like");list.add("You");for(int i=0;i<list.size();i++){System.out.print(list.get(i)+" ");}System.out.println();System.out.println("----------------------------------------");for(int i=list.size()-1;i>=0;i--){System.out.print(list.get(i)+" ");}System.out.println();System.out.println("----------------------------------------");Node node1=new Node("china");Node node2=new Node("sina");Node node3=new Node("I");Node node4=new Node("like");Node node5=new Node("You");node1.previous=node5;node1.next =node2;node2.previous=node1;node2.next=node3;node3.previous=node2;node3.next=node4;node4.previous=node3;node4.next=node5;node5.previous=node4;node5.next=node1;Node node=node1;for(int i=0;i<5;i++){System.out.print(node.str+" ");node=node.next;}System.out.println();System.out.println("----------------------------------------");for(int i=0;i<5;i++){node=node.previous;System.out.print(node.str+" ");}}}class Node{Node previous;String str;Node next;public Node(String str){this.str=str;}}//链表的实现采用自定义节点类实现。

0 0