UNIX 技巧: UNIX 高手的另外10个习惯

//贴点代码
package com.List.sym;

import java.util.LinkedList;
import java.util.List;

public class Test {

/**
* @param args
*/
public static void main(String[] args) {

//单边链表生成与反转，方法一
List <Integer> siglist=new LinkedList<Integer>();
siglist.add(3);
siglist.add(4);
siglist.add(5);
siglist.add(1);
siglist.add(2);
siglist.add(8);
siglist.add(7);
ListTest listTest=new ListTest();
listTest.printList(siglist);
listTest.reverse(siglist);

}

}

package com.List.sym;

import java.util.List;

public class ListTest {

public void reverse(List<Integer>siglist){
for (int i = 0,j=siglist.size()-1; i < siglist.size()/2 ; i++,j--) {
int tempi=siglist.get(i);
int tempj=siglist.get(j);
siglist.set(i, tempj);
siglist.set(j, tempi);
}
printList(siglist);
}
public void printList(List<Integer>siglist){
Iterator<Integer> iterator=siglist.iterator();
while (iterator.hasNext()) {
int i=iterator.next();
System.out.print("  "+i);

}
System.out.println("");
}
}

package com.List.sym;

public class Node {
private int value;
private Node next;
public  Node(int value){
this.value=value;
}
public int getValue() {
return value;
}

public void setValue(int value) {
this.value = value;
}

public Node getNext() {
return next;
}

public void setNext(Node next) {
this.next = next;
}

}

好困！