package algorithm;
import java.util.*;
public class Array_List_Usage {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("start");
ArrayList<Integer> li = generage();
print(li);
reverse(li);
print(li);
}
private static ArrayList<Integer> generage() {
ArrayList<Integer> list = new ArrayList<Integer>();
while(true) {
Scanner src = new Scanner(System.in);
String str = src.next();
if(str.equals("end")){
break;
}
int a = Integer.parseInt(str);
list.add(a);
}
return list;
}
public static void print(ArrayList list) {
for(int i=0,n=list.size();i<n;i++) {
int value = (Integer)list.get(i);
System.out.println(value + " ");
}
System.out.println();
}
private static void reverse(ArrayList list) {
int n = list.size();
for(int i=0,j=n/2; i<j; i++) {
int temp = (Integer)list.get(i);
list.set(i, list.get(n-i-1));
list.set(n-i-1, temp);
}
}
import java.util.*;
public class Array_List_Usage {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("start");
ArrayList<Integer> li = generage();
print(li);
reverse(li);
print(li);
}
private static ArrayList<Integer> generage() {
ArrayList<Integer> list = new ArrayList<Integer>();
while(true) {
Scanner src = new Scanner(System.in);
String str = src.next();
if(str.equals("end")){
break;
}
int a = Integer.parseInt(str);
list.add(a);
}
return list;
}
public static void print(ArrayList list) {
for(int i=0,n=list.size();i<n;i++) {
int value = (Integer)list.get(i);
System.out.println(value + " ");
}
System.out.println();
}
private static void reverse(ArrayList list) {
int n = list.size();
for(int i=0,j=n/2; i<j; i++) {
int temp = (Integer)list.get(i);
list.set(i, list.get(n-i-1));
list.set(n-i-1, temp);
}
}
}
//泛型 ArrayList<T> list = new ArrayList<T>();