List集合的其它用法及算法

随时随地阅读更多技术实战干货，获取项目源码、学习资料，请关注源代码社区公众号(ydmsq666)

package cn;

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

public class Test {

	public static void main(String[] args) {
		List<Student> list = new ArrayList<Student>();
		list.add(new Student(1, "张三", 69));
		list.add(new Student(2, "李四", 39));
		list.add(new Student(3, "王五", 59));
		list.add(new Student(4, "吴六", 49));
		list.add(new Student(5, "蒋七", 79));
		// 按位置删除
		// list.remove(1);

		// 根据对象的某个属性删除，需要重写equals方法
		// list.remove(new Student(3,"王五",89));

		// indexOf获取对象的位置
		// int index=list.indexOf(new Student(2,"江4",89));
		// System.out.println(index);

		// 将集合元素排序
		// Collections.sort(list,new MySort());

		// 这里也可写成匿名内部类
		Collections.sort(list, new Comparator<Student>() {
			@Override
			public int compare(Student arg0, Student arg1) {
				return (int) (arg1.getGrade() - arg0.getGrade());
			}
		});
		// 将集合元素顺序随机排列
		// Collections.shuffle(list);

		for (Student s : list) {
			System.out.println(s.getCode() + "  " + s.getGrade() + "  "
					+ s.getName());
		}
		// for(int i=0;i<list.size();i++){
		// Student s=list.get(i);
		// System.out.println(s.getCode()+"  "+s.getGrade()+"  "+s.getName());
		// }

		// Iterator<Student> it=list.iterator();
		// while(it.hasNext()){
		// Student s=it.next();
		// System.out.println(s.getCode()+"  "+s.getGrade()+"  "+s.getName());
		// }

	}

}

class MySort implements Comparator<Student> {

	@Override
	public int compare(Student arg0, Student arg1) {
		return (int) (arg1.getGrade() - arg0.getGrade());

	}

}