java编程思想 ListIterator 逆序

package net.bigwrok;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;

public class CopyTest {
    static void reverse(List<Integer> list) {
        ListIterator<Integer> fwd = list.listIterator();
        ListIterator<Integer> rev = list.listIterator(list.size());
        int mid = list.size() / 2;// list.size() >> 1;
        for (int i = 0; i < mid; i++) {
            Integer tmp = fwd.next();
            fwd.set(rev.previous());
            rev.set(tmp);
        }
    }
    static void reverse2(List<Integer> list) {
        //仅仅输出  it.previous() ，第一次输出的元素index是 (size11 -1)
         int size11  =  list.size();
        ListIterator<Integer> it = list.listIterator(size11);
        while (it.hasPrevious()) {
            System.out.print (it.previous()+" , ");
        }
        System.out.println(); 
    }

    public static void main(String[] args) {
        List<Integer> src = Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9);
        List<Integer> dest = new LinkedList<Integer>(src);
         
        System.out.println("source: " + src);
        System.out.println("destination: " + dest);
        
        reverse(dest);
        //reverse2(dest);
        System.out.println("source: " + src);
        System.out.println("destination: " + dest);
        
         
    
    }

}

结果

source: [1, 2, 3, 4, 5, 6, 7, 8, 9]
destination: [1, 2, 3, 4, 5, 6, 7, 8, 9]
source: [1, 2, 3, 4, 5, 6, 7, 8, 9]
destination: [9, 8, 7, 6, 5, 4, 3, 2, 1]