Array类的测试

//Array测试

 

import java.util.Arrays;

class ArrayTest
{
 public static void main(String[] args)
 {
  /*
   * int[] num1=new int[]{1,2,3}; int[] num2=new int[10];
   * System.arraycopy(num1,0,num2,8,2); for(int i=0;i<num2.length;i++) {
   * System.out.println(num2[i]); }
   */
  /*
   * Point[] pts1=new Point[]{new Point(1,1),new Point(2,2),new
   * Point(3,3)}; Point[] pts2=new Point[3];
   * System.arraycopy(pts1,0,pts2,0,pts1.length); for(int i=0;i<pts1.length;i++) {
   * System.out.println("x="+pts2[i].x+",y="+pts2[i].y); } pts2[1].x=5;
   * pts2[1].y=5; System.out.println("x="+pts1[1].x+",y="+pts1[1].y);
   */
  /*
   * int[] num=new int[]{3,1,2}; Arrays.sort(num); for(int i=0;i<num.length;i++) {
   * System.out.println(num[i]); } int index=Arrays.binarySearch(num,3);
   * System.out.println("index="+index);
   * System.out.println("elements="+num[index]);
   */
  /*StudentThree[] ss = new StudentThree[]{new StudentThree("zhangsan" , 19) , new StudentThree("wangwu" , 24) ,
          new StudentThree("lisi" , 22) , new StudentThree("mybole" , 24)};
  Arrays.sort(ss);
  for(int i = 0 ; i<ss.length ; i++)
  {
   System.out.println(ss[i]);
  }
  int index = Arrays.binarySearch(ss , new StudentThree("lisi" , 22));
  System.out.println("index="+index);
  System.out.println(ss[index]);*/
  /*Employee[] emp1=new Employee[]{
    new Employee("1",22,"黄涛","工程师","男"),new Employee("2",25,"黄涛","工程师","男"),
    new Employee("3",25,"吴明","工程师","男"),new Employee("4",28,"黄涛","工程师","女"),
    new Employee("5",24,"叶樟","工程师","女"),new Employee("6",25,"叶樟","工程师","男")};
  Arrays.sort(emp1);
  for(int i=0;i<emp1.length;i++)
  {
   System.out.println(emp1[i]);
  }*/
 }
}
/*
class StudentThree implements Comparable
{
 int    age;
 
 String name;
 
 
 StudentThree(String name , int age)
 {
  this.name = name;
  this.age = age;
 }
 
 public String toString()
 {
  return "name="+name+",age="+age;
 }
 
 public int compareTo(Object obj)
 {
  StudentThree s = (StudentThree) obj;
  int result = age>s.age ? 1 : (age==s.age ? 0 : -1);
  if (0==result)
  {
   result = name.compareTo(s.name);
  }
  return result;
 }
}

class Point
{
 int x , y;
 
 
 public Point(int x , int y)
 {
  this.x = x;
  this.y = y;
 }
}*/

class Employee implements Comparable
{
 String num;
 
 int     age;
 
 String name;
 
 String job;
 
 String sex;
 
 
 public Employee(String num , int age , String name , String job , String sex)
 {
  this.num = num;
  this.age = age;
  this.name = name;
  this.job = job;
  this.sex = sex;
 }
 
 public int compareTo(Object o)
 {
  Employee em=(Employee)o;
  int resone=name.compareToIgnoreCase(em.name);
  if(0==resone)
  {
   resone=sex.compareTo(em.sex);
   
  }
  return resone;
 }
 public String toString()
 {
  return new StringBuffer("num="+num).append("age="+age).
     append("name="+name).append("job="+job).append("sex="+sex).toString();
 }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值