本文實例為大家分享了C++實現簡易通訊錄的具體代碼,供大家參考,具體內容如下
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
#include <iostream> #include <string> #define MAX 1000 using namespace std; // 設計聯系人的結構體 struct Person { string m_Name; int m_Sex; // 1、男 2 女 int m_Age; string m_Phone; string m_Addr; }; // 設計通訊錄的結構體 struct Addressbooks { struct Person personArray[MAX]; int m_Size; }; // 1、菜單界面 void showMenu() { cout << "***************************" << endl; cout << "***** 1、添加聯系人 *****" << endl; cout << "***** 2、顯示聯系人 *****" << endl; cout << "***** 3、刪除聯系人 *****" << endl; cout << "***** 4、查找聯系人 *****" << endl; cout << "***** 5、修改聯系人 *****" << endl; cout << "***** 6、清空聯系人 *****" << endl; cout << "***** 0、退出通訊錄 *****" << endl; cout << "***************************" << endl; } // 2、添加聯系人 void addPerson(Addressbooks * abs ) { // 判斷通訊錄是否已滿 if ( abs ->m_Size == MAX) { cout << "通訊錄已經滿,無法添加!" << endl; return ; } else { // 添加具體聯系人 string name; cout << "請輸入姓名:" << endl; cin >> name; abs ->personArray[ abs ->m_Size].m_Name = name; cout << "請輸入性別:" << endl; cout << "1----男\n2----女" << endl; int sex = 0; while ( true ) { cin >> sex; if (sex == 1 || sex == 2) { abs ->personArray[ abs ->m_Size].m_Sex = sex; break ; } cout << "輸入有誤,請重新輸入" << endl; } cout << "請輸入年齡:" << endl; int age = 0; cin >> age; abs ->personArray[ abs ->m_Size].m_Age = age; cout << "請輸入聯系電話:" << endl; string phone; cin >> phone; abs ->personArray[ abs ->m_Size].m_Phone = phone; cout << "請輸入家庭地址:" << endl; string address; cin >> address; abs ->personArray[ abs ->m_Size].m_Addr = address; abs ->m_Size++; cout << "添加成功!" << endl; system ( "pause" ); // 請按任意鍵繼續 system ( "cls" ); // 清屏操作 } } // 3、顯示所有的聯系人 void showPerson(Addressbooks * abs ) { // 判斷通訊錄中人數是否為0 if ( abs ->m_Size == 0) { cout << "當前記錄為空" << endl; } else { for ( int i = 0; i < abs ->m_Size; i++) { cout << "姓名:" << abs ->personArray[i].m_Name << "\t" ; cout << "性別:" << ( abs ->personArray[i].m_Sex == 1 ? "男" : "女" ) << "\t" ; cout << "年齡:" << abs ->personArray[i].m_Age << "\t" ; cout << "電話:" << abs ->personArray[i].m_Phone << "\t" ; cout << "住址:" << abs ->personArray[i].m_Addr << endl; } } system ( "pause" ); system ( "cls" ); } // 4、檢測聯系人是否存在,若存在,返回聯系人所在數組中的具體位置 // 參數1 通訊錄 參數2 對比姓名 int isExit(Addressbooks * abs , string name) { for ( int i = 0; i < abs ->m_Size; i++) { if ( abs ->personArray[i].m_Name == name) { return i; //找到了,返回該人在數組中的編號 } } return -1; // 沒有找到,則返回-1 } // 5、刪除指定的聯系人 void deletePerson(Addressbooks * abs ) { cout << "請輸入您要刪除的聯系人姓名:" << endl; string name; cin >> name; int ret = isExit( abs , name); if (ret != -1) { // 找到此人 進行刪除操作 for ( int i = ret; i < abs ->m_Size; i++) { abs ->personArray[i] = abs ->personArray[i + 1]; } abs ->m_Size--; cout << "刪除成功" << endl; } else { cout << "查無此人" << endl; } system ( "pause" ); system ( "cls" ); } // 6、查找指定的聯系人信息 void findPerson(Addressbooks * abs ) { cout << "請輸入您要查找的聯系人:" << endl; string name; cin >> name; int ret = isExit( abs , name); if (ret != -1) { cout << "姓名:" << abs ->personArray[ret].m_Name << "\t" ; cout << "性別:" << abs ->personArray[ret].m_Sex << "\t" ; cout << "年齡:" << abs ->personArray[ret].m_Age << "\t" ; cout << "電話:" << abs ->personArray[ret].m_Phone << "\t" ; cout << "地址:" << abs ->personArray[ret].m_Addr << endl;; } else { cout << "查無此人" << endl; } system ( "pause" ); system ( "cls" ); } // 7、修改指定的聯系人信息 void modifyPerson(Addressbooks * abs ) { cout << "請輸入您要修改的聯系人:" << endl; string name; cin >> name; int ret = isExit( abs , name); if (ret != -1) { string name; cout << "請輸入姓名:" << endl; cin >> name; abs ->personArray[ret].m_Name = name; cout << "請輸入性別:" << endl; cout << "1---男\t2---女" << endl; int sex = 0; //cin >> sex; while ( true ) { cin >> sex; if (sex == 1 || sex == 2) { abs ->personArray[ret].m_Sex = sex; break ; } cout << "輸入錯誤,請重新輸入:" << endl; } cout << "請輸入年齡:" << endl; int age = 0; cin >> age; abs ->personArray[ret].m_Age = age; cout << "請輸入聯系電話:" << endl; string phone; cin >> phone; abs ->personArray[ret].m_Phone = phone; cout << "請輸入一個家庭地址:" << endl; string address; cin >> address; abs ->personArray[ret].m_Addr = address; } else { cout << "查無此人" << endl; } system ( "pause" ); system ( "cls" ); } // 8、清空聯系人 void cleanPerson(Addressbooks * abs ) { abs ->m_Size = 0; cout << "聯系人已經清空!!!" << endl; system ( "pause" ); system ( "cls" ); } int main() { // 創建通訊錄結構體變量 Addressbooks abs ; // 初始化通訊錄中當前人數為0 abs .m_Size = 0; int select = 0; while ( true ) { // 菜單調用 showMenu(); cin >> select; switch (select) { case 1: // 1、添加聯系人 addPerson(& abs ); //利用地址傳遞可以修飾實參 break ; case 2: // 2、顯示聯系人 showPerson(& abs ); break ; case 3: // 3、刪除聯系人 deletePerson(& abs ); /* { cout << "請輸入刪除聯系人的姓名:" << endl; string name; cin >> name; if (isExit(&abs, name) == -1) { cout << "查無此人" << endl; } else { cout << "找到此人" << endl; } }*/ break ; case 4: // 4、查找聯系人 findPerson(& abs ); break ; case 5: // 5、修改聯系人 modifyPerson(& abs ); break ; case 6: // 6、清空聯系人 cleanPerson(& abs ); break ; case 0: // 0、退出通訊錄 cout << "歡迎下次使用" << endl; system ( "pause" ); return 0; break ; default : break ; } } system ( "pause" ); return 0; } |
以上就是本文的全部內容,希望對大家的學習有所幫助,也希望大家多多支持服務器之家。
原文鏈接:https://blog.csdn.net/qq_37796444/article/details/107093783