存储对象的数组
2015-07-25 11:02
429 查看
类
public class Person {
private String lastName;
private String firstName;
private int age;
public Person(String last,String first,int a){
lastName=last;
firstName=first;
age=a;
}
public void displayPerson(){
System.out.print("Last name:"+lastName+",First name:"+firstName+",Age:"+age);
}
public String getLast(){
return lastName;
}
}
主程序
public class ClassDataApp {
public static void main(String[] args){
int maxSize=100;
ClassDataArray array;
array=new ClassDataArray(maxSize);
array.insert("a", "a", 12);
array.insert("b", "b", 32);
array.insert("c", "c", 43);
array.insert("d", "d", 13);
array.insert("e", "e", 33);
array.displayA();
String seachKey="a";
Person found;
found=array.find(seachKey);
if(found!=null){
System.out.println("Found");
found.displayPerson();
}
else{
System.out.println("Can`t find "+seachKey);
}
System.out.println("Delete a and b");
array.delete("a");
array.delete("b");
array.displayA();
}
}
public class Person {
private String lastName;
private String firstName;
private int age;
public Person(String last,String first,int a){
lastName=last;
firstName=first;
age=a;
}
public void displayPerson(){
System.out.print("Last name:"+lastName+",First name:"+firstName+",Age:"+age);
}
public String getLast(){
return lastName;
}
}
public class ClassDataArray { private Person[] a; private int nElems; public ClassDataArray(int max){ a=new Person[max]; nElems=0; } //按姓查询 public Person find(String searchName){ int i; for(i=0;i<nElems;i++){ if(a[i].getLast().equals(searchName)) break; } if(i==nElems) return null; else return a[i]; } public void insert(String last,String first,int age){ a[nElems]=new Person(last, first, age); nElems++; } public boolean delete(String searchName){ int i; for(i=0;i<nElems;i++) if(a[i].getLast().equals(searchName)) break; if(i==nElems) return false; else{ for(int k=i;k<nElems;k++){ a[k]=a[k+1]; } nElems--; return true; } } public void displayA(){ for(int i=0;i<nElems;i++) a[i].displayPerson(); } }
主程序
public class ClassDataApp {
public static void main(String[] args){
int maxSize=100;
ClassDataArray array;
array=new ClassDataArray(maxSize);
array.insert("a", "a", 12);
array.insert("b", "b", 32);
array.insert("c", "c", 43);
array.insert("d", "d", 13);
array.insert("e", "e", 33);
array.displayA();
String seachKey="a";
Person found;
found=array.find(seachKey);
if(found!=null){
System.out.println("Found");
found.displayPerson();
}
else{
System.out.println("Can`t find "+seachKey);
}
System.out.println("Delete a and b");
array.delete("a");
array.delete("b");
array.displayA();
}
}
相关文章推荐
- Hadoop hdfs增删该查 简单写法
- HDU 4771 Stealing Harry Potter's Precious (深搜+广搜)
- 有太多的东西要学
- 按钮控件里面的间距问题
- 冒泡排序
- Java错误提示------------------Cannot reduce the visibility of the inherited method from MouseListener
- uva11624
- JQuery基础attribute
- 旋转数组
- BZOJ 1068 [SCOI2007]压缩 区间DP
- 数据库之总2
- HDU 1016 Prime Ring Problem
- 微软Win10 Build 10240推送更新补丁修正版KB3074680
- hadoop Hdfs文件上传下载
- C语言(3)--Fibonacci数列、候选人得票统计、字符串复制函数
- 数据库之总1
- 数据库之横表转纵表、纵表转横表
- 有序数组和二分法
- unbutu下安装与配置phpmyadmin
- 04-树9. Path in a Heap (25)