publicclassTest{publicstaticvoidmain(String[] args){// String[] strs = new String[] {"a","b","c"};// // for (int i = 0; i < 4; i++) {// System.out.println(strs[i]);// }// A a = new A();// A a = null;//空指针,java.lang.NullPointerException// System.out.println(a.i);// int i = 0;// System.out.println(3/i);/// by zero}}classA{int i;}
2.捕获异常:
int i =0;try{//try{}括住可能出异常的代码段
System.out.println(3/i);/// by zero}catch(Exception e){//当不知道捕获的是什么异常时,则直接使用Exception// e.printStackTrace();// System.out.println(e.getMessage());}
System.out.println("ok");
3.抛出异常:
publicclassTest1{publicstaticvoidmain(String[] args){
B b =newB();try{
b.test1(-100);}catch(Exception e){// TODO Auto-generated catch block
e.printStackTrace();}}}classB{int age;publicvoidtest1(int age)throws Exception{if(age >=0&& age <=150){this.age = age;
System.out.println(this.age);}else{thrownewException("年龄不在0-150");}}}
4.HashSet:
import java.util.HashSet;import java.util.Iterator;import java.util.Set;publicclassTest3{publicstaticvoidmain(String[] args){// Set set = new HashSet();
Set<Object> set =newHashSet<Object>();// //添加// set.add(1);// set.add("a");// System.out.println(set);// //删除// set.remove(1);// System.out.println(set);// //判断// System.out.println(set.contains("a"));// //清空// set.clear();// System.out.println(set);
set.add("a");
set.add("b");
set.add("c");
set.add("d");//迭代器遍历
Iterator it = set.iterator();while(it.hasNext()){
System.out.println(it.next());}//for each迭代for(Object obj : set){//把set的每个值取出赋给obj,直到循环set的所有值
System.out.println(obj);}//个数
System.out.println(set.size());//想让集合存同类型的对象:使用泛型
Set<String> set1 =newHashSet<String>();
set1.add("a");
set1.add("1");}}
5.TreeSet:
import java.util.Comparator;import java.util.Set;import java.util.TreeSet;publicclassTest4{publicstaticvoidmain(String[] args){// Set<Integer> set = new TreeSet<Integer>();// //TreeSet自然排序// set.add(5);// set.add(2);// set.add(3);// set.add(4);// System.out.println(set);// // set.remove(5);// set.contains(3);// set.clear();// // //两种遍历
Person p1 =newPerson("张三",23);
Person p2 =newPerson("李四",21);
Person p3 =newPerson("王五",16);
Person p4 =newPerson("赵六",25);
Set<Person> set =newTreeSet<Person>(newPerson());
set.add(p1);
set.add(p2);
set.add(p3);
set.add(p4);for(Person p : set){
System.out.println(p.name +" "+ p.age);}}}classPersonimplementsComparator<Person>{//把Person对象存入,并按年龄排序int age;
String name;publicPerson(){}publicPerson(String name,int age){this.name = name;this.age = age;}@Overridepublicintcompare(Person o1, Person o2){//年龄正序排if(o1.age > o2.age){return1;}elseif(o1.age < o2.age){return-1;}else{return0;}}}