---------------------- android培训、java培训、期待与您交流! ----------------------
1.集合框架(TreeSet)
2.集合框架(TreeSet存储自定义对象)
3.集合框架(二叉树)
import java.util.*;
/*
Set:无序,不可以重复元素.
|--HashSet:数据结构是哈希表.线城是非同步的.
保证元素唯一性的原理:判断元素的hashCode值是否相同.
如果相同,还会继续判断元素的equals方法,是否为true.
|--TreeSet:可以对Set集合中的元素进行排序.
底层数据结构为二叉树.
保证元素唯一性的依据:
compareTo方法return 0;
TreeSet排序的第一种方式:让元素自身具备比较性.
元素需要实现Comparable接口,覆盖compareTo方法.
这种方式也成为元素的自然顺序,或者叫做默认顺序.
TreeSet的第二种排序方式.
当元素自身不具备比较性时,或者具备的比较性不是所需要的.
这时就需要让集合自身具备比较性.
在集合初始化时,就有了比较方式.
需求:往TreeSet集合中存储自定义对象学生.
想按照学生的年龄进行排序.
记住,排序时,当主要条件相同时,一定判断一下次要条件.
*/
class TreeSetDemo
{
public static void main(String[] args)
{
TreeSet ts = new TreeSet();
ts.add(new Student("lisi02",22));
ts.add(new Student("lisi007",20));
ts.add(new Student("lisi09",19));
ts.add(new Student("lisi08",19));
Iterator it = ts.iterator();
while(it.hasNext())
{
Student stu = (Student)it.next();
System.out.println(stu.getName()+".."+stu.getAge());
}
}
class Student implements Comparable //该接口强制让学生具备比较性.
{
private String name;
private int age;
Student(String name,int age)
{
this.name= name;
this.age = age;
}
public int compareTo(Object obj)
{
if(!(obj instanceof Student))
throw new RuntimeException("不是学生对象");
Student s = (Student)obj;
System.out.println(this.name+"...compareto.."+s.name);
if(this.age>s.age)
return 1;
if(this.age==s.age)
{
return this.name.compareTo(s.name);
}
return -1;
}
public String getName()
{
return name;
}
public int getAge()
{
return age;
}
}
4.集合框架(实现Comparator方式排序)
import java.util.*;
/*
当元素自身不具备比较性,或者具备的比较性不是所需要的.
这时需要让容器自身具备比较性.
定义了比较器,将比较器对象作为参数传递给TreeSet集合的构造函数.
当两种排序都存在时,以比较器为主.
定义一个类,实现Comparator接口,覆盖compare方法.
*/
class Student implements Comparable//该接口强制让学生具备比较性.
{
private String name;
private int age;
Student(String name,int age)
{
this.name = name;
this.age = age;
}
public int compareTo(Object obj)
{
//return 0;
if(!(obj instanceof Student))
throw new RuntimeException("不是学生对象");
Student s = (Student)obj;
//System.out.println("this.name+"....compareTo.."+s.name);
if(this.age>s.age)
return 1;
if(this.age==age)
{
return this.name.compareTo(s.name);
}
return -1;
}
public String getName()
{
return name;
}
public int getAge()
{
return age;
}
}
class TreeSetDemo2
{
public static void main(String[] args)
{
TreeSet ts = new TreeSet();
ts.add(new Student("lisi02",22));
ts.add(new Student("lisi02",21));
ts.add(new Student("lisi007",20));
ts.add(new Student("lisi09",19));
ts.add(new Student("lisi06",18));
ts.add(new Student("lisi06",18));
ts.add(new Student("lisi007",29));
//ts.add(new Student("lisi007",20));
//ts.add(new Student("lisi01",40));
Iterator it = al.iterator();
while(it.hasNext())
{
Student stu = (Student)it.next();
System.out.println(stu.getName()+"...."+stu.getAge());
}
}
}
class MyCompare implements Comparator
{
public int compare(Object o1,Object o2)
{
Student s1 = (Student)o1;
Student s2 = (Student)o2;
int num = s1.getName().compareTo(s2.getName());
if(num==0)
{
return new Integer(s1.getAge()).compareTo(new Integer(s2.getAge()));
/*
if(s1.getAge())>s2.getAge())
return 1;
if(s1.getAge()==s2.getAge())
return -1;
return -1;
*/
}
return num;
}
}
5.集合框架(TreeSet练习)
/*
练习:按照字符串长度排序.
字符串本身具备比较性.但是他的比较方式不是所需要的.
这时就只能使用比较器.
*/
import java.util.*;
class TreeSetTest
{
public static void main(String[] args)
{
TreeSet t = new TreeSet(new StrLenComparator());
t.add("abcd");
ts.add("cc");
ts.add("cba");
ts.add("aaa");
ts.add("z");
ts.add("hahaha");
Iterator it = t.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}
class StrLenComparator implements Comparator
{
public int compare(Object o1,Object o2)
{
String s1 = (String)o1;
String s2 = (String)o2;
/*
if(s1.length()>s2.length())
return 1;
if(s1.length()==s2.length())
return 0;
*/
int num = new Integer(s1.length()).compareTo(new Integer(s2.length()));
if(num==0)
return s1.compareTo(s2);
return num;
}
}
/*
"90 -7 0 18 2 45 4"
将字符串的数值进行排序.使用TreeSet完成.
思路:
1.将字符串切割.
2.可以将这些对象存入TeeSet集合.因为TreeSet自身具备排序功能.
*/
import java.util.*;
class TreeSetTest2
{
public static void main(String[] args)
{
ArrayList al = new ArrayList();
String str = "90 -7 0 18 2 45 4";
String[] arr = str.split(" ");
TreeSet ts = new TreeSet();
for(int x=0; x<arr.length; x++)
{
//ts.add(new Integer(arr[x]));
ts.add(Integer.parseInt(arr[x]));
}
System.out.println(ts);
}
}
6.集合框架(泛型概述)
import java.util.*;
/*
泛型:JDK1.5版本以后出现新特性.用于解决安全问题,是一个类型安全机制.
好处:
1.将运行时期出现问题ClassCastException,转移到了编译时期.
方便于程序员解决问题.让运行时问题减少,安全.
2.避免了强制转换麻烦.
泛型格式:通过<>来定义要操作的引用数据类型.
在使用java提供的对象时,什么时候写泛型呢?
通常在集合框架中很常见,
只要见到<>就要定义泛型.
其实<>就是用来接收类型的.
当使用集合时,将集合要存储的数据类型作为参数传递到<>中即可.
*/
class GenericDemo
{
public static void main(String[] args)
{
ArrayList<String> al = new ArrayList<String>();
al.add("abc01");
al.add("abc0991");
al.add("abc014");
//al.add(4);//al.add(new Integer(4));
Iterator<String> it = al.iterator();
while(it.hasNext())
{
String s = it.next();
System.out.println(s+":"+s.length());
}
}
}
7.集合框架(泛型使用)
import java.util.*;
class GenericDemo2
{
public static void main(String[] args)
{
TreeSet<String> ts = new TreeSet<String>(new LenComparator());
ts.add("abcd");
ts.add("cc");
ts.add("cba");
ts.add("aaa");
ts.add("z");
ts.add("hahaha");
Iterator<String> it = ts.iterator();
while(it.hasNext())
{
String s = it.next();
System.out.println(s);
}
}
}
class LenComparator implements Comparator<String>
{
public int compare(String o1,String o2)
{
int num = new Integer(o2.length()).compareTo(new Integer(o1.length()));
if(num==0)
return o2.compareTo(o1);
return num;
}
}
8.集合框架(泛型类)
/*
class Tool
{
private Worker w;
public void setWorker(Worker w)
{
this.w = w;
}
public Worker getWorker()
{
return w;
}
}
*/
class Worker
{
}
class Student
{
}
//泛型前做法.
class Tool
{
private Object obj;
public void setObject(Object obj)
{
this.obj = obj;
}
public Object getObject()
{
return obj;
}
}
//泛型类定义
/*
什么时候定义泛型类?
当类中要操作的引用数据类型不确定的时候,
早期定义Object来完成扩展.
现在定义泛型来完成扩展.
*/
class Utils<QQ>
{
private QQ q;
public void setObject(QQ q)
{
this.q = q;
}
public QQ getObject()
{
return q;
}
}
class GenericDemo3
{
public static void main(String[] args)
{
Utils<Worker> u = new Utils<Worker>();
u.setObject(new Student());
Worker w = u.getObject();
/*
Tool t = new Tool();
t.setObject(new Student());
Worker w = (Worker)t.getObject();
*/
}
}
9.集合框架(泛型方法)
10.集合框架(静态方法泛型)
/*
class Demo<T>
{
public void show(T t)
{
System.out.println("show:"+t);
}
public void print(T t)
{
System.out.println("show:"+t);
}
}
*/
/*
//泛型类定义的泛型,在整个类中有效.如果被方法使用,
那么泛型类的对象明确要操作的具体类型后,所有要操作的类型就已经固定了.
为了让不同方法可以操作不同类型,而且类型还不确定.
那么可以将泛型定义在方法上.
*/
/*
特殊之处:
静态方法不可以访问类上定义的泛型.
如果静态方法操作的应用数据类型不确定,可以将泛型定义在方法上.
*/
class Demo<T>
{
public void show<T t>
{
System.out.println("show:"+t);
}
public <Q> void print(Q q)
{
System.out.println("print:"+q);
}
public static <W> void method(W t)
{
System.out.println("method:"+t);
}
}
class GenericDemo4
{
public static void main(String[] args)
{
Demo<String> d = new Demo<String>();
d.show("haha");
//d.show(4);
d.print(5);
d.print("hehe");
Demo.method("hahaha");
/*
Demo d = new Demo();
d.show("haha");
d.show(new Integer(4));
d.print("heihei");
*/
/*Demo<Integer> d = new Demo<Integer>();
d.show(new Integer(4));
d.print("haha");
Demo<String> d1 = new Demo<String>();
d1.print("haha");
d1.show(5);
*/
}
}
11.集合框架(泛型接口)
//泛型定义在接口上
interface Inter<T>
{
void show(T t);
}
class InterImpl implements Inter<String>
{
public void show(String t)
{
System.out.println("show:"+t);
}
}
class InterImple<T> implements Inter<T>
{
public void show(T t)
{
System.out.println("show:"+t);
}
}
class GenericDemo5
{
public static void main(String[] args)
{
InterImpl<Integer> i = new InterImpl<Integer>();
i.show(4);
//InterImpl i = new InterImpl();
//i.show("haha");
}
}
12.集合框架(泛型限定)
13.集合框架(泛型限定2)
import java.util.*;
/*
? 通配符.也可以理解为占位符.
泛型的限定:
? extends E:可以接受E类型或者E的子类型. 上限.
? super E:可以接受E类型或者E的父类型. 下限.
*/
class GenericDemo6
{
public static void main(String[] args)
{
/*
ArrayList<String> al = new ArrayList<String>();
al.add("abc1");
al.add("abc2");
al.add("abc3");
ArrayList<Integer> al1 = new ArrayList<Integer>();
al1.add(4);
al1.add(7);
al1.add(1);
printColl(al);
printColl(al1);
*/
ArrayList<Person> al = new ArrayList<Person>();
al.add(new Person("abc1"));
al.add(new Person("abc2"));
al.add(new Person("abc3"));
//printColl(al);
ArrayList<Student> al1 = new ArrayList<Student>();
al1.add(new Student("abc--1"));
al1.add(new Student("abc--2"));
al1.add(new Student("abc--3"));
printColl(al1); //ArrayList<? extends Person> al = new ArrayList<Student>();error
}
public static void printColl(Collection<? extends Person> al)
{
Iterator<? extends Person> it = al.iterator();
while(it.hasNext())
{
System.out.println(it.next().getName());
}
}
/*
public static void printColl(ArrayList<?> al)//ArrayList al = new ArrayList<Integer>();error
{
Iterator<?> it = al.iterator();
while(it.hasNext())
{
System.out.println(it.next().toString());
}
}
*/
}
class Person
{
private String name;
Person(String name)
{
this.name = name;
}
public String getName()
{
return name;
}
}
class Student extends Person
{
Student(String name)
{
super(name);
}
}
/*
class Student implements Comparable<Person>//<? super E>
{
public int compareTo(Person s)
{
this.getName() = s;
}
}
*/
class Comp implements Comparator<Person>
{
public int compare(Person s1,Person s2)
{
//Person s1 = new Student("abc1");
return s1.getName().compareTo(s2.getName());
}
}
import java.util.*;
class GenericDemo7
{
public static void main(String[] args)
{
TreeSet<Student> ts = new TreeSet<Student>(new Comp());
ts.add(new Student("abc03"));
ts.add(new Student("abc02"));
ts.add(new Student("abc06"));
ts.add(new Student("abc01"));
Iterator<Student> it = ts.iterator();
while(it.hasNext())
{
System.out.println(it.next().getName());
}
TreeSet<Worker> ts1 = new TreeSet<Worker>(new Comp());
ts1.add(new Worker("wabc--03"));
ts1.add(new Worker("wabc--02"));
ts1.add(new Worker("wabc--06"));
ts1.add(new Worker("wabc--01"));
Iterator<Worker> it1 = ts1.iterator();
while(it1.hasNext())
{
System.out.println(it1.next().getName());
}
}
}
/*
class StuComp implements Comparator<Student>
{
public int compare(Student s1,Student s2)
{
return s1.getName().compareTo(s2.getName());
}
}
class WorkerComp implements Comparator<Worker>
{
public int compare(Worker s1,Worker s2)
{
return s1.getName().compareTo(s2.getName());
}
}
*/
class Comp implements Comparator<Person>
{
public int compare(Person p1,Person p2)
{
return p2.getName().compareTo(p1.getName());
}
}
class Person
{
private String name;
Person(String name)
{
this.name = name;
}
public String getName()
{
return name;
}
public String toString()
{
return "person :"+name;
}
}
class Student extends Person
{
Student(String name)
{
super(name);
}
}
class Worker extends Person
{
Worker(String name)
{
super(name);
}
}
import java.util.*;
class GenericTest
{
public static void main(String[] args)
{
/*
ArrayList al = new ArrayList();
al.add(new Person("heihei"));
ArrayList al1 = new ArrayList();
al1.add("hah1");
al1.add("hah2");
al.addAll(al1);
System.out.println(al);
*/
ArrayList<Person> al = new ArrayList<Person>();
al.add(new Person("aha"));
ArrayList<Student> al1 = new ArrayList<Student>();
al1.add(new Student("haha"));
al.addAll(al1);
Iterator<Person> it = al.iterator();
while(it.hasNext())
{
System.out.println(it.next().getName());
}
}
}
class Person
{
private String name;
Person(String name)
{
this.name = name;
}
public String getName()
{
return name;
}
public String toString()
{
return "person:"+name;
}
}
class Student extends Person
{
Student(String name)
{
super(name);
}
}
/*
Person p = new Person();
p.equals("hahha");
Demo d = new Demo();
d.equals(p);
*/
//泛型搞定:泛型的使用.
//对于集合类中的泛型会用即可.可以看得懂上限下限,泛型类和泛型方法定义.
---------------------- android培训、 java培训、期待与您交流! ----------------------详细请查看: http://edu.csdn.net/heima