编程环境 Visual Studio 2017
|
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 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 |
#include <iostream> #include <string> #include <cstring> #include <set> #include <map> #include <iterator> #include <vector> #include <fstream> #include <ctime> #include <list> #include <queue> #include <memory> using namespace std; // practice 1 bool Palindrome(string input) { string::iterator forware = input.begin(); string::reverse_iterator backware = input.rbegin(); int input_length = input.length(); for (int i = 0; i < input_length / 2; i++) { if (*forware == *backware) { forware++; backware++; } else return false; } return true; } void p16_1(void) { string input; cout << "Enter the string: "; getline(cin, input); if (Palindrome(input)) { cout << input << " is a palindrome." << endl; } else { cout << input << " is not a palindrome." << endl; } } // practice 2 void p16_2(void) { string input; string temp; cout << "Enter string: "; getline(cin, input); temp = input; for (string::iterator it = input.begin(); it != input.end();) { if (!isalpha(*it)) { it = input.erase(it); continue; } else { *it = tolower(*it); it++; } } if (Palindrome(input)) { cout << input << " is a palindrome." << endl; } else { cout << input << " is not a palindrome." << endl; } } // practice 3 const string FileName = "word.txt"; void p16_3(void) { vector<string> wordlist; ifstream in; in.open(FileName.c_str()); string inword; while (in >> inword) { wordlist.push_back(inword); } srand(time(0)); char play; cout << "Will you play a word game? <y/n> "; cin >> play; play = tolower(play); while (play == 'y') { string target = wordlist[rand() % wordlist.size()]; int length = target.length(); string attemp(length, '-'); string badchars; int guesses = 6; cout << "Guess my scret word. It has " << length << " letters, and you guess\n" << "one letter at a time. You get " << guesses << " wrong guesses.\n"; cout << "Your word: " << attemp << endl; while (guesses > 0 && attemp != target) { char letter; cout << "Guess a letter: "; cin >> letter; if (badchars.find(letter) != string::npos || attemp.find(letter) != string::npos) { cout << "You already gueesed that. Try again.\n"; continue; } int loc = target.find(letter); if (loc == string::npos) { cout << "Oh, bad guess!\n"; --guesses; badchars += letter; } else { cout << "Good guess!\n"; attemp[loc] = letter; loc = target.find(letter, loc + 1); while (loc != string::npos) { attemp[loc] = letter; loc = target.find(letter, loc + 1); } } cout << "You word: " << attemp << endl; if (attemp != target) { if (badchars.length() > 0) cout << "Bad choices: " << badchars << endl; cout << guesses << " bad guesses left\n"; } } if (guesses > 0) { cout << "That's right!\n"; } else { cout << "Sorry, the word is " << target << ".\n"; } cout << "Will you play anther? <y/n> "; cin >> play; play = tolower(play); } cout << "Bye\n"; return; } // practice 4 int reduce(long ar[], int n) { list<long> lar(ar, ar + n); lar.sort(); lar.unique(); int lar_length = 0; for (list<long>::iterator it = lar.begin(); it != lar.end(); it++) { *(ar + lar_length) = *it; lar_length++; } for (int i = lar_length; i < n; i++) { *(ar + lar_length) = 0; } return lar_length; } void p16_4(void) { long ar[] = { 12, 2, 13, 12, 2, 55, 32, 44, 32, 100, 32, 12 }; int ar_length = 12; int reduce_length = 0; cout << "original array length: " << ar_length << endl; cout << "original array: "; for (int i = 0; i < ar_length; i++) { cout << ar[i] << " " ; } cout << endl; reduce_length = reduce(ar, ar_length); cout << "After reduce, array length: " << reduce_length << endl; cout << "After reduce, array: "; for (int i = 0; i < reduce_length; i++) { cout << ar[i] << " " ; } cout << endl; } // practice 5 template <class T> int Treduce(T ar[], int n) { list<T> lar(ar, ar + n); lar.sort(); lar.unique(); int lar_length = 0; for (list<T>::iterator it = lar.begin(); it != lar.end(); it++) { *(ar + lar_length) = *it; lar_length++; } return lar_length; } void p16_5(void) { // long long ar[] = { 12, 2, 13, 12, 2, 55, 32, 44, 32, 100, 32, 12 }; int ar_length = 12; int reduce_length = 0; cout << "original array length: " << ar_length << endl; cout << "original array: "; for (int i = 0; i < ar_length; i++) { cout << ar[i] << " "; } cout << endl; reduce_length = Treduce(ar, ar_length); cout << "After reduce, array length: " << reduce_length << endl; cout << "After reduce, array: "; for (int i = 0; i < reduce_length; i++) { cout << ar[i] << " "; } cout << endl; cout << endl; // string string sar[] = { "hello", "jimmy", "array", "hehe", "jimmy", "hehe" }; int sar_length = 6; cout << "original string array length: " << sar_length << endl; cout << "original string array: "; for (int i = 0; i < sar_length; i++) { cout << sar[i] << " "; } cout << endl; reduce_length = Treduce(sar, sar_length); cout << "After reduce, array length: " << reduce_length << endl; cout << "After reduce, array: "; for (int i = 0; i < reduce_length; i++) { cout << sar[i] << " "; } cout << endl; } // practice 6 class Customer { private: long arrive; int processtime; public: Customer() { arrive = processtime = 0; } void set(long when) { processtime = rand() % 3 + 1; arrive = when; } long when() const { return arrive; } int ptime() const { return processtime; } }; const int MIN_PER_HR = 60; bool newcustomer(double x) { return (rand() * x / RAND_MAX < 1); } void p16_6(void) { srand(time(0)); cout << "Case study: Band of Heather Automatic Teller\n"; cout << "Enter maximum size of queue: "; int qs; cin >> qs; queue<Customer> line; cout << "Enter the number of simulation hours: "; int hours; cin >> hours; long cyclelimit = MIN_PER_HR * hours; cout << "Enter the average number of customer per hours: "; double perhour; cin >> perhour; double min_per_cust; min_per_cust = MIN_PER_HR / perhour; Customer temp; long turnaways = 0; long customers = 0; long served = 0; long sum_line = 0; int wait_time = 0; long line_wait = 0; for (int cycle = 0; cycle < cyclelimit; cycle++) { if (newcustomer(min_per_cust)) { if (qs == line.size()) turnaways++; else { customers++; temp.set(cycle); line.push(temp); } } if (wait_time <= 0 && !line.empty()) { temp = line.front(); wait_time = temp.ptime(); line_wait += cycle - temp.when(); served++; line.pop(); } if (wait_time > 0) { wait_time--; } sum_line += line.size(); } if (customers > 0) { cout << "customers accepted: " << customers << endl; cout << " customers served: " << served << endl; cout << " turnaways: " << turnaways << endl; cout << "average queue size: "; cout.precision(2); cout.setf(ios_base::fixed, ios_base::floatfield); cout << (double)sum_line / cyclelimit << endl; cout << " average wait time: " << (double)line_wait / served << " minutes\n"; } else cout << "No customers!\n"; cout << "Done!\n"; return; } // practice 7 vector<int> Lotto(int total, int choice) { vector<int> ar(total); for (int i = 0; i < total; i++) { ar[i] = i + 1; } random_shuffle(ar.begin(), ar.end()); vector<int> car(choice); for (int i = 0; i < choice; i++) { car[i] = ar[i]; } sort(car.begin(), car.end()); return car; } void p16_7(void) { srand(time(0)); vector<int> winners; winners = Lotto(51, 6); cout << "Winners' number: "; for (size_t i = 0; i < 6; i++) { cout << winners[i] << " "; } cout << endl; return; } // practice 8 void p16_8(void) { set<string> Mat_friend; set<string> Pat_friend; set<string> union_friend; string input; cout << "Mat friend: "; while (cin >> input) { Mat_friend.insert(input); if (cin.get() == '\n') { break; } } copy(Mat_friend.begin(), Mat_friend.end(), ostream_iterator<string, char>(cout, " ")); cout << endl; cout << "Pat friend: "; while (cin >> input) { Pat_friend.insert(input); Mat_friend.insert(input); if (cin.get() == '\n') { break; } } copy(Pat_friend.begin(), Pat_friend.end(), ostream_iterator<string, char>(cout, " ")); cout << endl; set_union(Mat_friend.begin(), Mat_friend.end(), Pat_friend.begin(), Pat_friend.end(), insert_iterator<set<string> >(union_friend, union_friend.begin())); cout << "All friends: "; copy(union_friend.begin(), union_friend.end(), ostream_iterator<string, char>(cout, " ")); cout << endl; } // practice 9 const long VEC_SIZE = 1000000; // 这个量级i5-3320M大概用了一分多钟 void p16_9(void) { cout << "-----start-----" << endl; srand(time(0)); vector<int> vi0(VEC_SIZE); for (long i = 0; i < VEC_SIZE; i++) { vi0[i] = rand() % 10000 + 1; } vector<int> vi(vi0); list<int> li(vi0.begin(), vi0.end()); clock_t vector_start = clock(); sort(vi.begin(), vi.end()); clock_t vector_end = clock(); clock_t list_start = clock(); li.sort(); clock_t list_end = clock(); copy(vi0.begin(), vi0.end(), li.begin()); clock_t copy_sort_time_start = clock(); copy(li.begin(), li.end(), vi.begin()); sort(vi.begin(), vi.end()); copy(vi.begin(), vi.end(), li.begin()); clock_t copy_sort_time_end = clock(); cout << "test vector size: " << VEC_SIZE << endl; cout << "vector sort time: " << (double)(vector_end - vector_start) / CLOCKS_PER_SEC << endl; cout << "list sort time: " << (double)(list_end - list_start) / CLOCKS_PER_SEC << endl; cout << "list copy sort time: " << (double)(copy_sort_time_end - copy_sort_time_start) / CLOCKS_PER_SEC << endl; cout << "-----end-----" << endl; } // practice 10 struct Review { string title; int rating; double price; }; bool FillRevice(Review & rr) { cout << "Enter book title (quit to quit): "; getline(cin, rr.title); if (rr.title == "quit") { return false; } cout << "Enter book rating: "; cin >> rr.rating; if (!cin) { return false; } cout << "Enter book price: "; cin >> rr.price; if (!cin) { return false; } while (cin.get() != '\n') continue; return true; } void ShowReview(const shared_ptr<Review> & rr) { cout << rr->rating << "\t" << rr->title << "\t" << rr->price << endl; } bool operator<(const shared_ptr<Review> & r1, const shared_ptr<Review> & r2) { if (r1->title < r2->title) { return true; } else if (r1->title == r2->title && r1->rating < r2->rating) return true; else return false; } bool worseThan(const shared_ptr<Review> & r1, const shared_ptr<Review> & r2) { if (r1->rating < r2->rating) return true; else return false; } bool betterThan(const shared_ptr<Review> & r1, const shared_ptr<Review> & r2) { if (r1->rating > r2->rating) return true; else return false; } bool expensiveThan(const shared_ptr<Review> & r1, const shared_ptr<Review> & r2) { if (r1->price > r2->price) return true; else return false; } bool cheaperThan(const shared_ptr<Review> & r1, const shared_ptr<Review> & r2) { if (r1->price < r2->price) return true; else return false; } void p16_10(void) { vector<shared_ptr<Review> > books; Review temp; while (FillRevice(temp)) { shared_ptr<Review> in(new Review(temp)); books.push_back(in); } cout << "Enter your choice: " << endl; cout << "0：按原始顺序显示， 1：按字母表顺序显示， 2：按评级升序显示" << endl; cout << "3：按评级降序显示， 4：按价格升序显示 ， 5：按价格降序显示" << endl; cout << "6：退出" << endl; int choice = 0; vector<shared_ptr<Review> > original_books(books.begin(), books.end()); while (cin >> choice && choice != 6) { switch (choice) { case 0: copy(original_books.begin(), original_books.end(), books.begin()); break; case 1: sort(books.begin(), books.end()); break; case 2: sort(books.begin(), books.end(), worseThan); break; case 3: sort(books.begin(), books.end(), betterThan); break; case 4: sort(books.begin(), books.end(), cheaperThan); break; case 5: sort(books.begin(), books.end(), expensiveThan); break; default: break; } for_each(books.begin(), books.end(), ShowReview); } return; } int main(int argc, char ** argv) { p16_10(); while (cin.get()); return 0; } |
此文为博主原创文章，转载请注明出处
