Accelerated C++ 习题解答 第5章

最新推荐文章于 2021-12-20 16:09:03 发布
最新推荐文章于 2021-12-20 16:09:03 发布
阅读量1.2k 收藏 5
点赞数 1
分类专栏： Accelerated C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/u013706695/article/details/19985779
版权

习题解答部分来自网上已有解答

EX.5-0

1)

#include <iostream>
#include <vector>
#include <string>
#include <cctype>
#include <conio.h>
 
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
 
vector<string> split (conststring& s)
{
   vector<string>ret;
   typedef string::size_type string_size;
   string_size i = 0;
 
   while (i != s.size()) {
      while (i != s.size() && isspace(s[i]))
        ++i;
 
      string_size j = i;
 
      while (j != s.size() && !isspace(s[j]))
        ++j;
 
      if (i != j) {
        ret.push_back(s.substr(i,j-i));
        i = j;
      }
   }
   return ret;
}
 
int main()
{
   string s;
   while (getline (cin, s)) {
      vector<string>v = split(s);
 
      for (vector<string>::size_type i = 0; i !=v.size(); ++i) {
        cout <<v[i] << endl;
      }
   }
   getch();
   return 0;
}

2)

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <conio.h>
 
using namespace std;
 
string::size_type width(constvector<string>& v)
{
   string::size_typemaxlen = 0;
   for (vector<string>::size_type i = 0; i !=v.size(); ++i)
      maxlen =max(maxlen, v[i].size());
   return maxlen;
}
 
vector<string> frame(constvector<string>& v)
{
   vector<string>ret;
   string::size_typemaxlen = width(v);
   string border(maxlen+ 4, '*');
 
   ret.push_back(border);
   for (vector<string>::size_type i = 0; i != v.size();++i) {
      ret.push_back("* " + v[i] + string(maxlen-v[i].size(),' ') +"*");
   }
   ret.push_back(border);
   return ret;
}
 
int main()
{
   vector<string>content, output;
 
   string s;
   while (getline(cin, s)) {
      content.push_back(s);
   }
   output = frame(content);
   for (vector<string>::size_type i = 0; i !=output.size(); ++i) {
      cout <<output[i] << endl;
   }
   getch();
   return 0;
}

3)

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <conio.h>
 
using namespace std;
 
string::size_type width(constvector<string>& v)
{
   string::size_typemaxlen = 0;
   for (vector<string>::size_type i = 0; i !=v.size(); ++i)
      maxlen =max(maxlen, v[i].size());
   return maxlen;
}
 
vector<string> frame(constvector<string>& v)
{
   vector<string>ret;
   string::size_typemaxlen = width(v);
   string border(maxlen+ 4, '*');
 
   ret.push_back(border);
   for (vector<string>::size_type i = 0; i !=v.size(); ++i) {
      ret.push_back("* " + v[i] + string(maxlen-v[i].size(),' ') +"*");
   }
   ret.push_back(border);
   return ret;
}
 
vector<string> vcat(constvector<string>& top,constvector<string>& bottom)
{
   vector<string>ret = top;
   ret.insert(ret.end(),bottom.begin(), bottom.end());
   return ret;
}
 
int main()
{
   vector<string>content, output;
 
   string s;
   while (getline(cin, s)) {
      content.push_back(s);
   }
   output =vcat(content, frame(content));
   for (vector<string>::size_type i = 0; i !=output.size(); ++i) {
      cout <<output[i] << endl;
   }
   getch();
   return 0;
}

4)

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <conio.h>
 
using namespace std;
 
string::size_type width(constvector<string>& v)
{
   string::size_typemaxlen = 0;
   for (vector<string>::size_type i = 0; i !=v.size(); ++i)
      maxlen =max(maxlen, v[i].size());
   return maxlen;
}
 
vector<string> frame(constvector<string>& v)
{
   vector<string>ret;
   string::size_typemaxlen = width(v);
   string border(maxlen+ 4, '*');
 
   ret.push_back(border);
   for (vector<string>::size_type i = 0; i !=v.size(); ++i) {
      ret.push_back("* " + v[i] + string(maxlen-v[i].size(),' ') +"*");
   }
   ret.push_back(border);
   return ret;
}
 
 
vector<string> hcat(constvector<string>& left,constvector<string>& right)
{
   vector<string>ret;
   string::size_type  width1 = width(left) + 1;
   vector<string>::size_typei = 0, j = 0;
   while (i != left.size() || j != right.size()) {
      string s;
 
      if (i != left.size()) {
        s = left[i++];
      }
 
      s += string(width1- s.size(), ' ');
 
      if (j != right.size()) {
        s += right[j++];
      }
     
      ret.push_back(s);
   }
   return ret;
}
 
int main()
{
   vector<string>content, output;
 
   string s;
   while (getline(cin, s)) {
      content.push_back(s);
   }
   output =hcat(content, frame(content));
   for (vector<string>::size_type i = 0; i !=output.size(); ++i) {
      cout <<output[i] << endl;
   }
   getch();
   return 0;
}

EX.5-1

 

EX.5-2

1)      vector版本

#include <algorithm>
#include <vector>
#include <iostream>
#include <string>
#include <fstream>
#include <ctime>
#include <conio.h>
 
#include "Student_info.h"
#include "grade.h"
 
//driver program for grade partitioning examples
 
using std::cin;
using std::cout;
using std::endl;
using std::sort;
using std::string;
using std::vector;
using std::max;
using std::ifstream;
using std::ofstream;
 
vector<Student_info> extract_fails(vector<Student_info>&students) {
 vector<Student_info> fail;
#ifdef _MSC_VER
 std::vector<Student_info>::iterator iter = students.begin();
#else
 vector<Student_info>::iterator iter = students.begin();
#endif
 
  while (iter != students.end()) {
    if (fgrade(*iter)) {
     fail.push_back(*iter);
      iter =students.erase(iter);
    } else
      ++iter;
  }
 
  return fail;
}
 
int main() {
 vector<Student_info> vs;
  Student_info s;
  string::size_typemaxlen = 0;
 
  ifstream infile; 
  infile.open("100.txt"); //Elapsed:15 
  //infile.open("1000.txt"); //Elapsed:484 
  //infile.open("10000.txt"); //Elapsed:43297 
  if(!infile.is_open()){ 
      cout<<"can not open the file..."<<std::endl; 
      getch(); 
      exit(1); 
  } 
 
  while (read(infile, s)) {
    maxlen =max(maxlen, s.name.size());
    vs.push_back(s);
  }
 
  sort(vs.begin(),vs.end(), compare);
 
  clock_t start =clock();
 vector<Student_info> fails = extract_fails(vs);
  clock_t elapsed =clock() - start;
 
  cout << "Elapsed: " << elapsed <<endl;
 
  //  for (int i = 0; i< fails.size(); ++i)
  //    cout <<fails[i].name << " " << grade(fails[i]) << endl;
 
  getch();
  return 0;
}

 

2) list版本

#include <algorithm>
#include <list>
#include <iostream>
#include <string>
#include <fstream>
#include <ctime>
#include <conio.h>
 
#include "Student_info.h"
#include "grade.h"
using std::cin;
using std::cout;
using std::endl;
using std::sort;
using std::string;
using std::list;
using std::max;
using std::ifstream;
using std::ofstream;
 
list<Student_info>extract_fails(list<Student_info>& students) {
 list<Student_info> fail;
#ifdef _MSC_VER
  std::list<Student_info>::iteratoriter = students.begin();
#else
 vector<Student_info>::iterator iter = students.begin();
#endif
 
  while (iter != students.end()) {
    if (fgrade(*iter)) {
     fail.push_back(*iter);
      iter =students.erase(iter);
    } else
      ++iter;
  }
 
  return fail;
}
 
int main() {
 list<Student_info> vs;
  Student_info s;
  string::size_typemaxlen = 0;
 
  ifstream infile; 
  //infile.open("100.txt"); //Elapsed:16 
  //infile.open("1000.txt"); //Elapsed:31 
  infile.open("10000.txt"); //Elapsed:453
  if(!infile.is_open()){ 
      cout<<"can not open the file..."<<std::endl; 
      getch(); 
      exit(1); 
  } 
 
  while (read(infile, s)) {
    maxlen =max(maxlen, s.name.size());
    vs.push_back(s);
  }
 
  vs.sort(compare);
 
  clock_t start =clock();
 list<Student_info> fails = extract_fails(vs);
  clock_t elapsed =clock() - start;
 
  cout << "Elapsed: " << elapsed <<endl;
 
  //  for (int i = 0; i< fails.size(); ++i)
  //    cout <<fails[i].name << " " << grade(fails[i]) << endl;
 
  getch();
  return 0;
}

 

EX.5-3(5-4)

#include <algorithm>
#include <list>
#include <vector>
#include <iostream>
#include <string>
#include <ctime>
#include <conio.h>
#include "Student_info.h"
#include "grade.h"
 
using std::cin;
using std::cout;
using std::endl;
using std::sort;
using std::string;
using std::list;
using std::vector;
using std::max;
 
typedef list<Student_info> Student_infos;
//typedef vector<Student_info> Student_infos;
 
Student_infos extract_fails(Student_infos& students) {
  Student_infos fail;
#ifdef _MSC_VER
 Student_infos::iterator iter = students.begin();
#else
 Student_infos::iterator iter = students.begin();
#endif
 
  while (iter != students.end()) {
    if (fgrade(*iter)) {
     fail.push_back(*iter);
      iter = students.erase(iter);
    } else
      ++iter;
  }
 
  return fail;
}
 
int main() {
  Student_infos vs;
  Student_info s;
  string::size_typemaxlen = 0;
  while (read(cin, s)) {
    maxlen =max(maxlen, s.name.size());
    vs.push_back(s);
  }
 
  //vs.sort(compare);
 
  Student_infos fails =extract_fails(vs);
 
  for (Student_infos::const_iterator i = fails.begin();i != fails.end(); ++i)
    cout <<i->name << " " <<grade(*i) << endl;
 
  getch();
  return 0;
}

EX.5-5

#include <iostream>
#include <string>
#include <vector>
#include <conio.h>
 
using namespace std;
 
vector<string> center(constvector<string>& picture) {
  vector<string>new_picture;
 vector<string>::size_type max_length = 0;
 
  for (vector<string>::const_iterator i =picture.begin();
       i !=picture.end(); ++i)
    if (i->size() > max_length)
      max_length =i->size();
 
  for (vector<string>::const_iterator i =picture.begin();
       i !=picture.end(); ++i) {
   vector<string>::size_type padding = (max_length - i->size()) /2;
    stringnew_line(padding, ' ');
    new_line += *i;
   new_picture.push_back(new_line);
  }
 
  return new_picture;
}
 
int main() {
  vector<string>picture;
 
  picture.push_back("*");
  picture.push_back("***");
  picture.push_back("*****");
 
  vector<string>new_picture = center(picture);
 
  for (vector<string>::const_iterator i =new_picture.begin();
       i !=new_picture.end(); ++i)
    cout << *i<< endl;
 
  getch();
  return 0;
}
 

EX.5-6

#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <string>
#include <ctime>
#include <conio.h>
 
#include "Student_info.h"
#include "grade.h"
 
//driver program for grade partitioning examples
 
using std::cin;
using std::cout;
using std::endl;
using std::sort;
using std::string;
using std::vector;
using std::max;
using std::ifstream;
using std::ofstream;
 
vector<Student_info>extract_fails(vector<Student_info>& students) {
 vector<Student_info> fail;
#ifdef _MSC_VER
 std::vector<Student_info>::size_type i = 0;
#else
 vector<Student_info>::size_type i = 0;
#endif
 
  while (i != students.size()) {
    if (fgrade(students[i])) {
     fail.push_back(students[i]);
     students.insert(students.begin(), students[i]);
      ++i;
    }
    ++i;
  }
   
 students.resize(students.size() - fail.size());
 
  return fail;
}
 
int main() {
 vector<Student_info> vs;
  Student_info s;
  string::size_typemaxlen = 0;
 
 
  ifstream infile; 
  //infile.open("100.txt"); //Elapsed:16 
  infile.open("1000.txt"); //Elapsed:1125 
  //infile.open("10000.txt"); //Elapsed:108297
  if(!infile.is_open()){ 
      cout<<"can not open the file..."<<std::endl; 
      getch(); 
      exit(1); 
  } 
 
 
  while (read(infile, s)) {
    maxlen =max(maxlen, s.name.size());
    vs.push_back(s);
  }
 
  //  sort(vs.begin(),vs.end(), compare);
 
  clock_t start =clock();
 vector<Student_info> fails = extract_fails(vs);
  clock_t elapsed =clock() - start;
 
  cout << "Elapsed: " << elapsed <<endl;
  getch();
  return 0;
}

EX.5-7

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <conio.h>
 
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using std::max;
 
string::size_type width(constvector<string>& v)
{
   string::size_typemaxlen = 0;
   for (vector<string>::size_type i = 0; i !=v.size(); ++i)
      maxlen =max(maxlen, v[i].size());
   return maxlen;
}
 
vector<string> frame(constvector<string>& v)
{
   vector<string>ret;
   string::size_typemaxlen = width(v);
   string border(maxlen+ 4, '*');
 
   ret.push_back(border);
 
   for (vector<string>::size_type i = 0; i !=v.size(); ++i) {
      ret.push_back("* " + v[i] + string(maxlen -v[i].size(),' ') + "*");
   }
 
   ret.push_back(border);
   return ret;
}
 
int main()
{
   vector<string>v, ret;
   string s;
   string::size_typemaxlen;
 
   while (getline(cin, s)) {
      v.push_back(s);
   }
 
   ret = frame(v);
 
   for (vector<string>::const_iterator it =ret.begin(); it != ret.end(); ++it) {
      cout << *it<< endl;
   }
 
   getch();
   return 0;
}

EX.5-9

#include <iostream>
#include <string>
#include <vector>
 
using namespace std;
 
bool has_uppercase(conststring& word) {
  for (string::size_type i = 0; i != word.size(); ++i)
    if (isupper(word[i]))
      return true;
 
  return false;
}
 
void print_string_vector(constvector<string>& v) {
  for (vector<string>::const_iterator i =v.begin(); i != v.end(); ++i)
    cout << *i<< endl;
}
 
int main() {
  string s;
  vector<string>no_uppercase;
  vector<string>uppercase;
 
  while (cin >> s)
    if (has_uppercase(s))
     uppercase.push_back(s);
    else
     no_uppercase.push_back(s);
 
  cout << "\nNo uppercase letters:" << endl;
 print_string_vector(no_uppercase);
 
  cout << "Has uppercase letters:" << endl;
 print_string_vector(uppercase);
 
  return 0;
}

EX.5-10

#include <algorithm>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
#include <conio.h>
 
using namespace std;
 
bool is_palindrome(conststring& word) {
  string reversed;
 reverse_copy(word.begin(), word.end(), back_inserter(reversed));
  return (word == reversed);
}
 
int main() {
  vector<string>palindromes;
  stringlongest_palindrome;
  string s;
 
  while (cin >> s)
    if (is_palindrome(s)) {
     palindromes.push_back(s);
 
      if (s.length() > longest_palindrome.length())
   longest_palindrome =s;
    }
 
  cout << "\nPalindromes:" << endl;
 
  for (vector<string>::const_iterator it =palindromes.begin();
       it !=palindromes.end(); ++it)
    cout << *it<< endl;
  cout << endl;
 
  cout << "Longest: " << longest_palindrome<< endl;
 
  getch();
  return 0;
}

EX.5-11

#include <iostream>
#include <string>
#include <vector>
#include <conio.h>
 
using namespace std;
 
const string ascenders = "bdfhklt";
const string descenders = "gjpqy";
 
bool has_chars(conststring& word,const string& chars) {
  for (string::size_type i = 0; i != word.length();i++)
    for (string::size_type j = 0; j != chars.length();j++)
      if (word[i] == chars[j])
   return true;
 
  return false;
}
 
int main() {
  vector<string>has_asc_or_dsc;
  stringlongest_word_without_asc_or_dsc;
  string s;
 
  while (cin >> s)
    if (has_chars(s, ascenders) || has_chars(s,descenders))
     has_asc_or_dsc.push_back(s);
    else if (s.length()> longest_word_without_asc_or_dsc.length())
      longest_word_without_asc_or_dsc= s;
 
  cout << "\nHas ascenders or descenders: "<< endl;
 
  for (vector<string>::const_iterator it =has_asc_or_dsc.begin();
       it !=has_asc_or_dsc.end(); ++it)
    cout << *it<< endl;
 
  cout << "Longest word without ascenders or descenders:"
       <<longest_word_without_asc_or_dsc << endl;
 
  getch();
  return 0;
}


那张旧唱片的旋律
关注
专栏目录
Accelerated C++：通过示例进行编程实践——练习解答（第5章）
CSAP
10-15 2432
Accerated C++：Practical Programming by Example
Accelerated C++ 习题解答 第9章
u013706695的专栏
03-16 703
部分解答来自网上已有解答 EX.9-1 Student_info.h #pragma once #include #include  class Student_info { public:  Student_info();              Student_info(std::istream&);  std::string name() const { re
Accelerated C++ Exercise 5-1（0）
D-Boy的专栏
11-17 920
#ifndef GUARD_split_h #define GUARD_split_h #include #include std::vector split(const std::string&); #endif#include #include #include #include "split.h" using std::vector; using std::string;
[c++菜鸟]《Accelerate C++》习题解答
weixin_30566149的博客
07-11 791
第0章 0-0 编译并运行Hello, world! 程序。 #include <iostream> using namespace std; int main() { cout << "Hello, world!" << endl; return 0; } 0-1 下面的表达式是做什么的？ 　3+4 计算3+4...
Accelerated C++ 第1章答案
weixin_44957370的博客
09-25 331
1-0：编译 运行并测试本章中的程序 #include <iostream> using namespace std; int main() { cout << "请输入你的名字" << endl; string name; cin >> name; cout << "hello：" << name << endl; } #include <iostream> using namespace st
C++第三次作业3-1（Accelerated C++第五章）
mazicwong的博客
10-08 783
（一）單詞分類 1.       題意描述：編寫一個程序對以空白符（注意：包括回車換行符，也就是輸入可能爲多行）爲間隔的單詞序列輸入流進行轉換後輸出，輸出格式為：先輸出全部的小寫單詞，然後輸出首字母大寫的單詞，最後輸出大寫單詞（假設只有這三種形式的單詞）；且同一類的單詞以與出現順序相反的順序輸出，也就是後出現的先輸出。 譬如輸入： Write Aprogram  That COUNTS
Accelerated C++ 习题解答 第0章
u013706695的专栏
02-19 1326
Ex.0-0 #include #include   int main() {    std::cout "Hello, world!"    getch();    return 0; }   Ex.0-1 3+4是一个表达式，产生的结果是7，此运算没有副作用。   Ex.0-2 #include #include   int main() {
Accelerated C++ 习题解答 第1章
u013706695的专栏
02-19 1989
Ex.1-0 1) #include #include #include   int main() {    std::cout "pleause enter your name:";    std::string name;    std::cin >>name;      std::cout "hello, " "!"    getch();
Accelerated C++ 习题解答 第4章
u013706695的专栏
02-20 1983
部分习题参考了网上已有的解答 Ex.4-0 median.h #ifndef GUARD_median_h#define GUARD_median_h #include double median(std::vectordouble>);#endif   median.cpp #include #include #include  using std::
Accelerated c++中文版2004第四章答案（个人）
m0_64250057的博客
12-20 506
Accelerated c++中文版2003学习答案
Accelerated C++ 速成课后习题答案及源码
06-25
c++ 学习课后资源
accelerated c++ 课后习题答案:原书作者提供代码
05-28
accelerated c++ 课后习题答案:原书作者提供 0~16章习题答案都有
Accerlerated-C++中文版习题答案（含书pdf）
03-22
Accerlerated-C++中文版习题答案（含文中程序），这是完整版，1-16章的习题资源都有，看见别人上传的不完整，想把自己的完整版上传上去，也想赚点积分
Accelerated C++ 课后练习精选答案
在所不辞的博客
02-06 4211
目录 第0章 0-2：Write a program that, when run, writes 0-5：Is this a valid program? Why or why not? 0-7：What about this one? 0-9：What is the shortest valid program? 0-10：Rewrite the Hello, world! pr...
最好的C++入门书籍《Accelerated C++》 ——附全部课后习题答案以及学习心得
韩江雪de 小屋
03-21 6202
篇章目录1 内容简介2 作者简介3 心得与习题答案 1 内容简介 内容简介：《Accelerated C++ 中文版通过示例进行编程实践》系统介绍C++程序设计，是美国斯坦福大学的经典教材。从使用C++标准库中的高级抽象开始，使读者很快掌握编程方法。每一章都有很经典独特的例子以及非常到位的讲解，覆盖了C++更多领域的内容，从标准库容器、泛型算法的使用，到类的设计、泛型算法的设计，本书都进行了详细的...
Accelerated C++ 习题答案
weixin_30883777的博客
01-04 463
1. 在google的groups,也就是http://groups.google.com里发现很多人在讨论这本书中个别题的答案.如果你想要某一道题的答案,就在那搜Accelerated C++ exercise 3-2,其中3-2是题号,这是示范 2. Paul Parks 国外的在弄http://www.parkscomputing.com/accelerated-cpp-solution...
Accelerated C++: 实战编程指南
"Accelerated C++ - Practical Programming by Example" 《Accelerated C++》是由Andrew Koenig和Barbara E. Moo合著的一本经典C++编程书籍，于2000年由Addison-Wesley出版，第二版共336页，ISBN号为0-201-70353-X...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值