ArrayList(排序+遍历）

package fanxing;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;

public class MyDemo {

	//
	public static class MyComparator implements Comparator<Student>
	{

		//comparator的返回值决定o1 o2哪一个在前面
		
		public int compare(Student o1, Student o2) 
		{

			
			//排序01：按照学号进行排序
			if(o1.sno<o2.sno)
				return -1;
			else
				if(o1.sno>o2.sno)
					return 1;
				else
					return 0;
			
//			//排序02：按照名字的排序
//			return o1.name.compareTo(o2.name);		
		}
		
	}
	
	
	public static void main(String[] args) {
		

		ArrayList<Student> arr=new ArrayList<>();
		//ArrayList arr=new ArrayList<>();
		//ArrayList<Student> arr=new ArrayList<Student>();
		
		arr.add(new Student(2017,"Jiu Bo","15137742640"));
		arr.add(new Student(2017,"Jiu Sen","15137742640"));
		arr.add(new Student(2015,"Ying Ying","15137742640"));
		arr.add(new Student(2019,"Chang Shan","15137742640"));
		
		//遍历01
		System.out.println("初始遍历...");
		for(int i=0;i<arr.size();i++)
		{
			Student s=arr.get(i);
    		System.out.println(s);
		}
		
		//排序
		arr.sort(new MyComparator());
		//遍历02：简化版for循环
		System.out.println("排序遍历...");
		for(Student s : arr)
		{
			System.out.println(s);
		}
		

		//遍历03：迭代器遍历
		System.out.println("迭代器遍历...");
		Iterator<Student>iter=arr.iterator();

		while(iter.hasNext())
		{
			Student s=iter.next();
			System.out.println(s);
		}
		System.out.println("exit");
		
	}

}