shujujiegou.java

一个简单的数据结构的例子

    下面是使用数组来构建了一个简单的球队队员信息关系模型，一个队员的信息包括：姓、名、号码、得分、和年龄。第一个类person实现基本的数据类型的构建，而第二个类arr是具体的对该类型的具体操作,具体有插入，删除，查找三种基本操作。具体实现如下：

// 2007-11-17
//main class name: high2.java

//Basic class :person
class person
{
private String lastname;
private String firstname;
private int number;
private double score;
private int age;
//.......................................................................
public person(String la,String fi,int nu,int ag,double sc)
{
lastname = la;
firstname = fi;
number = nu;
age = ag;
score = sc;
}
//......................................................................
public void display()
{
   System.out.println(" The lastname is : " + lastname);
   System.out.println(" The firstname is : " + firstname);
   System.out.println(" Age is :" + age);
   System.out.println(" number is :" + number);
   System.out.println(" Score is :" + score);
}
//show end
//.....................................................................
public String lastnames()
{
return lastname;
}
}
//....................................................................
//
//class name :arrs

class arrs
{
private person[] a;
private int em;

public arrs(int max)
{
    a = new person[max];
    em = 0;
}
public void insert(String las, String fir,int ages,int num,double sco)
{
   a[em] = new person(las,fir,ages,num,sco);
   em++;
}
public person find(String lasts)
{
   int j;
   for(j = 0; j<em;j++)
    if(a[j].lastnames().equals(lasts))
     break;

   if(j == em)
    {
      System.out.println("Not found the lastname : " + lasts );
      return null;
   }
   else
    {
       System.out.println("The lastname : " + lasts + " has found!");
      a[j].display();
     return a[j];
    }
}
public boolean delete(String lastna)
{
   int j;
   for(j = 0; j < em;j++)
    if(a[j].lastnames().equals(lastna))
     break;
   
   if(j == em)
   {
    System.out.println("Not found the lastname : " + lastna);
    return false;
   }
   else
   {
    int k ;
    for(k = j;k < em; k ++)
     a[k] = a[k+1];
     em--;
    System.out.println(" Delete the person : " + lastna + " succeed!");
    return true;
}
}
public void desplay()
{
   int j;
   for(j=0;j<em;j++)
   a[j].display();
}
}
//main high2.java
//You can run it like this: java -verbose:class high2

public class high2
{
public static void main(String[] args)throws Exception
{
   arrs arr = new arrs(100);
   arr.insert("YaoMing","Zhao",25,84,98.5);
   arr.insert("ZhangJian","Li",24,124,97.3);
   arr.insert("LouWQ","zou",26,12,95.4);
   arr.insert("BaoHe","Fang",26,34,93.6);
   arr.insert("DuoF","Hang",24,46,91.4);
   arr.desplay();
   System.out.println("The insert run succeed! now will run find: ");
    
    person found;
   found = arr.find("YaoMing");
   if(found != null)
   {
    System.out.println("The find run secceed!");
    found.display();
   }

     found = arr.find("gou");
     if(found != null)
     {

     System.out.println("The find run secceed!now will run delete: ");
     found.display();
     }
     
   arr.delete("gou");
   arr.delete("BaoHe");
   arr.desplay();
   System.out.println("The system is end!");
}
}

   
// The main end!!!