|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
package
com.wxws.smsB;
public
class
Customer {
int
No;
int
integarl;
}
package
com.wxws.smsB;
public
class
Customers {
Customer[] customers =
new
Customer[
100
];
public
void
add(Customer cust) {
for
(
int
i =
0
; i < customers.length; i++) {
if
(customers[i] ==
null
) {
customers[i] = cust;
break
;
}
}
}
public
void
show() {
System.out.println(
"会员列表*****"
);
for
(
int
i =
0
; i < customers.length; i++) {
if
(customers[i] !=
null
) {
System.out.println(customers[i].No +
"\t"
+ customers[i].integarl +
"\t"
);
}
}
}
public
int
find(
int
find) {
for
(
int
i =
0
; i < customers.length; i++) {
if
(customers[i] !=
null
) {
if
(customers[i].No == find) {
System.out.println(
"该会员的积分为:"
+ customers[i].integarl);
break
;
}
else
{
System.out.println(
"没有该会员!"
);
}
}
}
return
find;
}
}
package
com.wxws.smsB;
import
java.util.Scanner;
public
class
Test {
/**
* @param args
*/
public
static
void
main(String[] args) {
// TODO Auto-generated method stub
Scanner in =
new
Scanner(System.in);
Customers B =
new
Customers();
for
(
int
i =
0
; i <
5
; i++) {
Customer A =
new
Customer();
System.out.print(
"请输入会员编号:"
);
A.No = in.nextInt();
System.out.print(
"请输入会员积分:"
);
A.integarl = in.nextInt();
B.add(A);
}
B.show();
System.out.println(
"请输入要查找的会员编号:"
);
int
find=in.nextInt();
B.find(find);
}
}
|
本文转自 Y幕徐 51CTO博客，原文链接:http://blog.51cto.com/765133133/1427021
