728x90
내가 한 과제
|
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
import java.util.Arrays;
import java.util.Scanner;
public class Address_ {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
/*
Menu
1. 친구추가
2. 친구삭제
3. 친구검색
4. 친구수정
5. 모든 데이터 출력
6. 종료
*/
String Member[][] = new String[100][5];
int mCount = 0;
boolean t = true;
while(t) {
// 메뉴
System.out.println("-------menu---------");
System.out.println("1.친구추가");
System.out.println("2.친구삭제");
System.out.println("3.친구검색");
System.out.println("4.친구수정");
System.out.println("5.모든 데이터 출력");
System.out.println("6.종료");
System.out.println("--------------------");
// 입력 1 ~ 6
System.out.print("원하는 메뉴번호를 입력하세요 : ");
int worknum = sc.nextInt();
switch( worknum ) {
case 1:
insert( Member, mCount );
mCount++;
break;
case 2:
delete(Member);
break;
case 3:
find(Member);
break;
case 4:
modify(Member);
break;
case 5:
allprint( Member );
break;
case 6:
if(worknum == 6) {
System.out.println("시스템이 종료되었습니다.");
t = false;
}
}
}
}
static void insert(String member[][], int count) {
Scanner sc = new Scanner(System.in);
// title
System.out.print("이름 = ");
String name = sc.next();
System.out.print("나이 = ");
String age = sc.next();
System.out.print("전화번호 = ");
String phone = sc.next();
System.out.print("주소 = ");
String address = sc.next();
System.out.print("내용 = ");
String content = sc.next();
member[count][0] = name;
member[count][1] = age;
member[count][2] = phone;
member[count][3] = address;
member[count][4] = content;
}
static void allprint( String mem[][] ) {
for (int i = 0; i < mem.length; i++) {
for (int j = 0; j < mem[i].length; j++) {
if(mem[i][j] != null) {
System.out.print(mem[i][j] + " ");
if(j == 4) {
System.out.println();
}
}
}
}
}
static void delete(String [][]totaladdress) {
Scanner sc = new Scanner(System.in);
System.out.println("누구를 삭제 할까요? = ");
String name;
name = sc.next();
for (int i = 0; i < totaladdress.length; i++) {
for (int j = 0; j < totaladdress[i].length; j++) {
if( name.equals(totaladdress[i][0]) ) {
for (int z = i; z < totaladdress.length-1; z++) {
for (int t = 0; t < totaladdress[z].length; t++) {
totaladdress[z][t] = totaladdress[z+1][t];
}
}
}
}
}
System.out.println("삭제되었습니다");
}
static void find(String [][]totaladdress) {
Scanner sc = new Scanner(System.in);
System.out.println("누구의 정보를 찾을까요? = ");
String nameFind;
nameFind = sc.next();
boolean b = true;
while(b) {
for (int i = 0; i < totaladdress.length; i++) {
for (int j = 0; j < totaladdress[i].length; j++) {
if( nameFind.equals(totaladdress[i][0]) ) {
int u = i;
System.out.print(totaladdress[u][j]+ "\t");
b = true;
}
}
}
b = false;
}//while
System.out.println();
}
static void modify(String [][]totaladdress) {
String modifyName;
Scanner sc = new Scanner(System.in);
System.out.print("연락처를 수정할 사람은 누군가요? = ");
modifyName = sc.next();
for (int i = 0; i < totaladdress.length; i++) {
for (int j = 0; j < totaladdress[i].length; j++) {
if( modifyName.equals(totaladdress[i][j]) ) {
System.out.println("수정할 연락처를 입력하세요 = ");
String after;
after = sc.next();
String temp;
temp = totaladdress[i][2] ;
totaladdress[i][2] = after;
after = temp;
}
}
}
}
}
|
cs |
728x90
'JAVA' 카테고리의 다른 글
| 11일차//[java]에서의 Exception 예외 (0) | 2021.01.25 |
|---|---|
| 11일차//[java]에서의 메소드 오버로딩(Overload) (0) | 2021.01.25 |
| 10일차//[java]학생들의 성적 합계(method사용) (0) | 2021.01.24 |
| 9일차//[java] 두수를 나눗셈 연산으로 몫과 나머지를 구함 (method)사용 (0) | 2021.01.21 |
| 8일차//[java] 배열의 값에 2배 연산 된 값이 산출되도록 (method)사용 (0) | 2021.01.21 |
