//实现了Comparable接口的对象,才能进行排序
public class Student implements Comparable<Student> {
public String name;
public int age;
public Student(){
}
public Student(String name,int age){
this.name = name;
this.age = age;
}
public String toString() {
return "姓名:"+name+",年龄:"+age;
}
//实现Comparable接口的compareTo比较的方法
public int compareTo(Student stu) {
if(this.age == stu.age){
return 0;
}else if(this.age > stu.age){
return 1;
}else{
return -1;
}
}
}
package demo;
import java.util.*;
public class TestCollctions {
//打印输出集合所有元素的方法
public static void print(Collection c){
for(Object obj : c) {
System.out.println(obj);
}
System.out.println();
}
public static void main(String[] args) {
ArrayList<String> list = new ArrayList<String>();
list.add("aa");
//addAll方法一次添加多个元素到集合中
Collections.addAll(list, "bb","cc","dd");
print(list);
//reverse方法对list集合进行反序
Collections.reverse(list);
print(list);
}
}
package demo;
import java.util.ArrayList;
import setDemo.Student;
public class TestList {
public static void main(String[] args) {
ArrayList<Student> list = new ArrayList<Student>();
list.add(new Student("张三"));
list.add(new Student("李四"));
list.add(new Student("王五"));
for(Student stu : list){
System.out.println(stu.name);
}
}
}
package demo;
import java.util.HashMap;
import setDemo.Student;
public class TestMap {
public static void main(String[] args) {
HashMap<Integer, Student> map = new HashMap<Integer, Student>();
map.put(1001,new Student("张三"));
map.put(1002,new Student("李四"));
map.put(1003,new Student("王五"));
for(Integer key : map.keySet()){
System.out.println(key+"=="+map.get(key).name);
}
}
}
package demo;
import java.util.*;
import setDemo.Student;
public class TestSet {
public static void main(String[] args) {
//定义集合时使用泛型
HashSet<Student> set = new HashSet<Student>();
//添加了泛型,只能往集合中放入Student对象,则不能放入字符串对象了
//set.add("张三");
set.add(new Student("张三"));
set.add(new Student("李四"));
set.add(new Student("王五"));
for(Student stu : set){
System.out.println(stu.name);
}
System.out.println();
Iterator<Student> it = set.iterator();
while(it.hasNext()){
Student stu = it.next();
System.out.println(stu.name);
}
/*
HashSet set = new HashSet();
set.add(new Student("张三"));
set.add(new Student("李四"));
set.add(new Student("王五"));
Iterator it = set.iterator();
while(it.hasNext()){
Object obj = it.next();
Student stu = (Student)obj;
System.out.println(stu.name);
}
*/
}
}
package demo;
import java.util.*;
public class TestSort {
public static void sort(List list){
System.out.println("排序前:");
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i)+"\t");
}
//排序
Collections.sort(list);
System.out.println("\n排序后:");
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i)+"\t");
}
}
public static void main(String[] args) {
ArrayList list = new ArrayList();
Collections.addAll(list, 11,5,33,8,22);
sort(list);
System.out.println("\n----------------");
list.clear();
Collections.addAll(list, "11","5","33","8","22");
sort(list);
}
}
package demo;
import java.util.*;
public class TestSort1 {
public static void main(String[] args) {
ArrayList<Student> list = new ArrayList<Student>();
list.add(new Student("张三",20));
list.add(new Student("李四",18));
list.add(new Student("王五",22));
list.add(new Student("赵六",19));
list.add(new Student("田七",20));
System.out.println("排序前:");
for(Student stu : list){
System.out.println(stu);
}
//排序
Collections.sort(list);
System.out.println("\n排序后:");
for(Student stu : list){
System.out.println(stu);
}
}
}