问题1比较简单哈try { //code A } catch(Exception e) { //on exception process } finally { // process B } 问题2,实现Comparable接口public class A implements Comparable<A> { private int pB; public int getPB() { return pB; } compareTo(A a) { reutrn a.getPB() - this.pB; } }//比较方法 A[] a = new A[]{a, b, c}); java.util.Arrays.sort(a);
try { //code A } catch(Exception e) { //on exception process } finally { // process B } 问题2,实现Comparable接口 Java code public class A implements Comparable<A> { private int pB; public int getPB() { return pB; } compareTo(A a) { reutrn a.getPB() - this.pB; } }//比较方法 A[] a = new A[]{a, b, c}); java.util.Arrays.sort(a);
{
//code A
}
catch(Exception e)
{
//on exception process
}
finally
{
// process B
}
问题2,实现Comparable接口public class A implements Comparable<A>
{
private int pB; public int getPB()
{
return pB;
} compareTo(A a)
{
reutrn a.getPB() - this.pB;
}
}//比较方法
A[] a = new A[]{a, b, c});
java.util.Arrays.sort(a);
try
{
//code A
}
catch(Exception e)
{
//on exception process
}
finally
{
// process B
}
问题2,实现Comparable接口 Java code
public class A implements Comparable<A>
{
private int pB; public int getPB()
{
return pB;
} compareTo(A a)
{
reutrn a.getPB() - this.pB;
}
}//比较方法
A[] a = new A[]{a, b, c});
java.util.Arrays.sort(a);
1. 用finally
2. 自己写个Comparator,并用Arrays.sort(t[],Comparator)
import java.util.*;
class A implements Comparable
{
int pB;
public A(int a1)
{
pB=a1;
}
public int compareTo(Object obj)
{
int k=((A)obj).pB;
if(k>pB)
return -1;
else if(k<pB)
return 1;
else
return 0;
}
public String toString()
{
return "("+pB+")";
}
}
public class ArrayCompare
{
public static void main(String[] args) {
A[] a={new A(5),new A(2),new A(4)};
System.out.println("排序前:"+Arrays.toString(a));
Arrays.sort(a);
System.out.println("排序后:"+Arrays.toString(a));
}}
A a1=new A();
A a2=new A();
if(a1.compareTo(a2)>0){
System.out.println("a1大于a2");
}
二楼的compareTo方法似乎比较反了,应该:
compareTo(A a)
{
reutrn this.pB- a.getPB();
}
try{
//code A
}catch(Exceptioni e){
//code Exception 异常程序要抛出
}finally{
code B
}