Accelerated C++ 习题解答 第7章

最新推荐文章于 2019-02-06 08:22:25 发布
最新推荐文章于 2019-02-06 08:22:25 发布
阅读量974 收藏 2
点赞数
分类专栏： Accelerated C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/u013706695/article/details/20537683
版权

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

EX.7-0

1)

#include <iostream>
#include <string>
#include <map>
#include <conio.h>
 
using namespace std;
 
int main()
{
   string s;
   map<string, int> counters;
 
   while (cin >> s) {
      ++counters[s];
   }
 
   for (map<string, int>::const_iteratoriter = counters.begin(); iter != counters.end(); ++iter) {
      cout <<iter->first << "\t"<< iter->second << endl;
   }
 
   getch();
   return 0;
}

2)

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <conio.h>
 
using namespace std;
 
//vector<string> split(const string& s)
//{
// vector<string>ret;
// typedefstring::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 (j != i) {
//      ret.push_back(s.substr(i,j-i));
//      i = j;
//    }
// }
// return ret;
//}
 
bool space(char c)
{
   return isspace(c);
}
 
bool not_space(char c)
{
   return !isspace(c);
}
 
vector<string> split(conststring& str)
{
   typedef string::const_iterator iter;
   vector<string>ret;
   iter i = str.begin();
   while (i != str.end()) {
      i = find_if(i,str.end(), not_space);
      iter j =find_if(i, str.end(), space);
 
      if (i != str.end())
        ret.push_back(string(i,j));
      i = j;
   }
   return ret;
}
 
map<string, vector<int>> xref(istream& in, vector<string> find_words(const string&) = split)
{
   string line;
   int line_number = 0;
   map<string,vector<int> > ret;
 
   while (getline(in, line)) {
      ++line_number;
 
      vector<string>words = find_words(line);
 
     for (vector<string>::const_iterator it =words.begin(); it != words.end(); ++it) {
        ret[*it].push_back(line_number);
      }
   }
   return ret;
}
 
int main()
{
   map<string,vector<int> > ret = xref(cin);
 
   for (map<string, vector<int> >::const_iterator it = ret.begin(); it != ret.end();++it) {
      cout <<it->first << " occurs on line(s):";
 
      vector<int>::const_iterator line_it =it->second.begin();
      cout <<*line_it;
 
      ++line_it;
 
      while (line_it != it->second.end()) {
        cout << ", " << *line_it;
        ++line_it;
      }
 
      cout <<endl;
   }
   getch();
   return 0;
}
 

EX.7-1

#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <conio.h>
 
using namespace std;
 
int main() {
  string s;
  map<string, int> counters;
  map<int, vector<string> > words_by_freq;
 
  while (cin >> s)
    ++counters[s];
 
  for (map<string, int>::const_iteratorit = counters.begin();
       it !=counters.end(); ++it)
   words_by_freq[it->second].push_back(it->first);
 
  for (map<int,vector<string> >::const_iterator i = words_by_freq.begin();
       i !=words_by_freq.end(); ++i) {
    cout << "\nFrequency: " << i->first<< endl;
 
    for (vector<string>::const_iterator j =i->second.begin();
    j != i->second.end(); ++j)
      cout << *j << endl;
  }
 
  getch();
  return 0;
}


EX.7-2

string get_letter_grade(doublegrade) {
  if (grade >= 90.0)
    return "A";
  if (grade >= 80.0 && grade < 90.0)
    return "B";
  if (grade >= 70.0 && grade < 80.0)
    return "C";
  if (grade >= 60.0 && grade < 70.0)
    return "D";
 
  return "F";
}
 

EX.7-3

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <conio.h>
 
using namespace std;
 
bool space(char c)
{
   return isspace(c);
}
 
bool not_space(char c)
{
   return !isspace(c);
}
 
vector<string> split(conststring& str)
{
   typedef string::const_iterator iter;
   vector<string>ret;
   iter i = str.begin();
   while (i != str.end()) {
      i = find_if(i,str.end(), not_space);
      iter j =find_if(i, str.end(), space);
 
      if (i != str.end())
        ret.push_back(string(i,j));
      i = j;
   }
   return ret;
}
 
map<string, vector<int>> xref(istream& in, vector<string> find_words(const string&) = split)
{
   string line;
   int line_number = 0;
   map<string,vector<int> > ret;
 
   while (getline(in, line)) {
      ++line_number;
 
      vector<string>words = find_words(line);
 
     for (vector<string>::const_iterator it =words.begin();it != words.end(); ++it)
        if (find(ret[*it].begin(), ret[*it].end(),line_number) == ret[*it].end())
           ret[*it].push_back(line_number);
 
 
   }
   return ret;
}
 
int main()
{
   map<string,vector<int> > ret = xref(cin);
 
   for (map<string, vector<int> >::const_iterator it = ret.begin(); it != ret.end();++it) {
      cout <<it->first << " occurs on line(s):";
 
      vector<int>::const_iterator line_it =it->second.begin();
      cout <<*line_it;
 
      ++line_it;
 
      while (line_it != it->second.end()) {
        cout << ", " << *line_it;
        ++line_it;
      }
 
      cout <<endl;
   }
   getch();
   return 0;
}


EX.7-4

#include <algorithm>
#include <map>
#include <iostream>
#include <string>
#include <sstream>//使用stringstream需要引入这个头文件
#include <vector>
#include <conio.h>
 
using namespace std;
 
#define LINE_LENGTH 80
 
bool space(char c)
{
   return isspace(c);
}
 
bool not_space(char c)
{
   return !isspace(c);
}
 
vector<string> split(conststring& str)
{
   typedef string::const_iterator iter;
   vector<string>ret;
   iter i = str.begin();
   while (i != str.end()) {
      i = find_if(i,str.end(), not_space);
      iter j =find_if(i, str.end(), space);
 
      if (i != str.end())
        ret.push_back(string(i,j));
      i = j;
   }
   return ret;
}
 
map<string, vector<int>> xref(istream& in, vector<string> find_words(const string&) = split) {
   string line;
   int line_number = 0;
   map<string,vector<int> > ret;
 
   while (getline(in, line)) {
      ++line_number;
 
      vector<string>words = find_words(line);
 
     for (vector<string>::const_iterator it =words.begin(); it != words.end(); ++it)
        ret[*it].push_back(line_number);
   }
 
   return ret;
}
 
int main() {
 
   map<string,vector<int> > ret = xref(cin);
 
   for (map<string, vector<int> >::const_iterator it = ret.begin(); it != ret.end();++it) {
      stringstream ss;
 
      //将"string"occurs on lines(s)装入到ss中
      ss <<it->first << " occurs on line(s):";
 
      vector<int>::const_iterator line_it =it->second.begin();
      ss <<*line_it;//将第一次出现的行号装入到ss中
      ++line_it;
 
      while (line_it != it->second.end()) {
        ss << ", " << *line_it;
        ++line_it;
      }
 
      string output =ss.str();
 
      //将ss中的内容通过一个一个的字符输出
      for (string::size_type i = 0; i != output.size();++i) {
        cout <<output[i];
        if ((i + 1) % LINE_LENGTH == 0)
           cout <<endl;
      }
 
      cout <<endl;
   }
 
   getch();
   return 0;
}


EX.7-7

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <conio.h>
 
using namespace std;
 
bool space(char c)
{
   return isspace(c);
}
 
bool not_space(char c)
{
   return !isspace(c);
}
 
vector<string> split(conststring& str)
{
   typedef string::const_iterator iter;
   vector<string>ret;
   iter i = str.begin();
   while (i != str.end()) {
      i = find_if(i,str.end(), not_space);
      iter j =find_if(i, str.end(), space);
 
      if (i != str.end())
        ret.push_back(string(i,j));
      i = j;
   }
   return ret;
}
 
map<string, vector<int>> xref(istream& in, vector<string> find_words(const string&) = split)
{
   string line;
   int line_number = 0;
   map<string,vector<int> > ret;
 
   while (getline(in, line)) {
      ++line_number;
 
      vector<string>words = find_words(line);
 
     for (vector<string>::const_iterator it =words.begin();it != words.end(); ++it)
        if (find(ret[*it].begin(), ret[*it].end(),line_number) == ret[*it].end())
           ret[*it].push_back(line_number);
 
 
   }
   return ret;
}
 
int main()
{
   map<string,vector<int> > ret = xref(cin);
 
   for (map<string, vector<int> >::const_iterator it = ret.begin(); it != ret.end();++it) {
      //cout << it->first << " occurs online(s): ";
      cout <<it->first << " occurs on ";
 
      cout <<((it->second.size() == 1) ? "line: ": "lines: ");
 
      vector<int>::const_iterator line_it =it->second.begin();
      cout <<*line_it;
 
      ++line_it;
 
      while (line_it != it->second.end()) {
        cout << ", " << *line_it;
        ++line_it;
      }
 
      cout <<endl;
   }
   getch();
   return 0;
}


EX.7-8

split.h

#ifndef GUARD_split_h
#define GUARD_split_h
 
#include <vector>
#include <string>
std::vector<std::string> split(conststd::string&);
 
#endif

 

split.cpp

#include <cctype>
#include <string>
#include <vector>
 
#include "split.h"
 
using std::vector;
using std::string;
 
#ifndef _MSC_VER
using std::isspace;
#endif
 
vector<string> split(conststring& s) {
  vector<string>ret;
  typedef string::size_type string_size;
  string_size i = 0;
 
  // invariant: we have processed characters `['originalvalue of `i', `i)'
  while (i != s.size()) {
    // ignore leading blanks
    // invariant: characters in range `['original `i', current`i)' are all spaces
    while (i != s.size() && isspace(s[i]))
      ++i;
 
    // find end of next word
    string_size j = i;
    // invariant: none of the characters in range `['original`j', current `j)' is a space
    while (j != s.size() && !isspace(s[j]))
      ++j;
 
    // if we found some nonwhitespace characters
    if (i != j) {
      // copy from `s' starting at `i' and taking `j' `\-' `i'chars
     ret.push_back(s.substr(i, j - i));
      i = j;
    }
  }
 
  return ret;
}


urls.h

#ifndef GUARD_urls_h
#define GUARD_urls_h
 
#include <vector>
#include <string>
 
std::vector<std::string> find_urls(const std::string& s);
 
#endif


urls.cpp

#include <algorithm>
#include <cctype>
#include <string>
#include <vector>
 
#include "urls.h"
 
using std::find;
using std::find_if;
 
#ifndef _MSC_VER
using std::isalnum;
using std::isalpha;
using std::isdigit;
#endif
 
using std::search;
using std::string;
using std::vector;
 
bool not_url_char(char);
 
string::const_iterator url_end(string::const_iterator,string::const_iterator);
 
string::const_iterator url_beg(string::const_iterator,string::const_iterator);
 
vector<string> find_urls(conststring& s) {
  vector<string>ret;
  typedef string::const_iterator iter;
  iter b = s.begin(), e= s.end();
 
  // look through the entire input
  while (b != e) {
    // look for one or more letters followed by `://'
    b = url_beg(b, e);
 
    // if we found it
    if (b != e) {
      // get the rest of the \s-1URL\s0
      iter after =url_end(b, e);
 
      // remember the \s-1URL\s0
     ret.push_back(string(b, after));
 
      // advance `b' and check for more \s-1URL\s0s on this line
      b = after;
    }
  }
 
  return ret;
}
 
string::const_iterator url_end(string::const_iterator b,
               string::const_iterator e) {
  return find_if(b, e, not_url_char);
}
 
bool not_url_char(char c) {
  // characters, in addition to alphanumerics, that canappear in a \s-1URL\s0
  static const stringurl_ch = "~;/?:@=&$-_.+!*'(),";
 
  // see whether `c' can appear in a \s-1URL\s0 and returnthe negative
  return !(isalnum(c) ||
      find(url_ch.begin(), url_ch.end(), c) !=url_ch.end());
}
 
string::const_iterator url_beg(string::const_iterator b,
               string::const_iterator e) {
  static const stringsep = "://";
 
  typedef string::const_iterator iter;
 
  // `i' marks where the separator was found
  iter i = b;
 
  while ((i = search(i, e, sep.begin(), sep.end())) !=e) {
    // make sure the separator isn't at the beginning or end ofthe line
    if (i != b && i + sep.size() != e) {
      // `beg' marks the beginning of the protocol-name
      iter beg = i;
      while (beg != b && isalpha(beg[-1]))
   --beg;
 
      // is there at least one appropriate character before andafter the separator?
      if (beg != i && !not_url_char(i[sep.size()]))
   return beg;
    }
 
    // the separator we found wasn't part of a \s-1URL\s0;advance `i' past this separator
    i += sep.size();
  }
 
  return e;
}

 

main.cpp

#include <map>
#include <iostream>
#include <string>
#include <vector>
#include <conio.h>
 
#include "split.h"
#include "urls.h"
 
using namespace std;
 
// find all the lines that refer to each word in theinput
map<string, vector<int>> xref(istream& in,
               vector<string> find_words(const string&) = split) {
  string line;
  int line_number = 0;
  map<string,vector<int> > ret;
 
  // read the next line
  while (getline(in, line)) {
    ++line_number;
 
    // break the input line into words
   vector<string> words = find_urls(line);
 
    // remember that each word occurs on the current line
    for (vector<string>::const_iterator it =words.begin();
    it != words.end(); ++it)
      ret[*it].push_back(line_number);
  }
 
  return ret;
}
 
int main() {
  // call `xref' using `split' by default
  map<string,vector<int> > ret = xref(cin);
 
  // write the results
  for (map<string, vector<int> >::const_iterator it = ret.begin();
       it != ret.end();++it) {
    // write the word
    cout <<it->first << " occurs on line(s):";
 
    // followed by one or more line numbers
    vector<int>::const_iterator line_it =it->second.begin();
 
    cout <<*line_it;  //write the first line number
 
    ++line_it;
 
    // write the rest of the line numbers, if any
    while (line_it != it->second.end()) {
      cout << ", " << *line_it;
      ++line_it;
    }
 
    // write a new line to separate each word from the next
    cout << endl;
  }
 
  getch();
  return 0;
}

那张旧唱片的旋律
关注
  • 0
    点赞
  • 踩
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
accelerated C++第七章 使用关联容器（7.3）
weixin_43755904的博客
12-15 163
//7.3产生一个交叉引用表 #include <iostream> #include <vector> #include <map> #include <string> #include <algorithm> #include <cctype> using namespace std; //7.3产生一个交叉引用表 //...
accelerated c++答案（自写）---第三章
Live Jiang
10-07 1346
看accelerated c++发现没有课后答案，我自己贴出来吧。随手所写，kan'kan'j
Accelerated C++：通过示例进行编程实践——练习解答（第7章）
CSAP
10-22 1834
7-0. Compile, execute, and test the programs in this chapter. 7-1. Extend the program from §7.2/124 to produce its output sorted by occurrence count. That is, the output should group all the words th
Accelerated C++ Exercise 7-1
D-Boy的专栏
11-19 738
#include #include #include #include using namespace std; int main() { string s; map counters; // store each word and an associated counter map > words_by_freq; // read the input, keepin
【第四章—第七章】【初识C++ Accelerated C++ 学习笔记】
DuanXu-yzc
11-05 2207
1、异常（exception） C++程序在运行时会遇到的不正常情况，比如：0作为除数、数组下标越界、打开不存在的文件、远程机器连接超时等等，一旦出现这些问题，会引发算法失效、程序运行时无故停止等现象，这就要求我们在设计软件算法时要考虑周全，而使用C++的异常机制是最常见的办法。 异常的抛出和处理主要使用三个关键字：throw、try、catch。 示例代码：
Accelerated C++ 习题答案
05-06
Accelerated C++ 习题答案
Accelerated C++ 速成课后习题答案及源码
06-25
Moo合著的《Accelerated C++》这本书的课后习题提供解答和源代码。这本书以其独特的方式教授C++，强调实践和理解编程概念，而非仅仅关注语言语法。以下是这个资源包含的一些关键知识点的详细解释： 1. **面向对象...
accelerated c++ 课后习题答案:原书作者提供代码
05-28
8. **第7章：构造函数和析构函数** - 讲解类的构造和析构过程，以及如何使用默认和拷贝构造函数。 9. **第8章：赋值操作符** - 讨论赋值操作符的重载，实现深拷贝和浅拷贝的区别。 10. **第9章：对象数组和指针** ...
Accelerated C++答案.rar
06-02
在"Accelerated C++答案.rar"这个压缩包中，包含了与《Accelerated C++》一书相关的所有练习题的解答。这些解答涵盖了从基本语法到面向对象编程的各种主题，包括但不限于： 1. **基本语法**：变量声明、数据类型、...
26 string
Leone9689的博客
03-28 295
Stringstring类型支持长度可变的字符串，C++标准库将负责管理与存储字符相关的内存，以及提供各种有用的操作 typedef basic_string< char > string; typedef basic_string< wchar_t >wstring; 要使用string类型对象，必须包含相关头文件 include < string > using std::strin
C++程序设计课后习题及解答（第七章）
好儿郎~志在四方
01-03 7631
（1）.如果派生类B已经重载了基类A的一个成员函数fn1()，没有重载基类A的成员函数fn2()，如何在派生类的函数中调用基类的成员函数fn1()，fn2()? (2).定义一个object类，有数据成员weight及函数成员：构造函数、析构函数、SetWeight()、Getweight(),由其公有派生类box类，增加数据成员height和width及函数成员：构造函数、析构函数、GetWidth()、SetWidth()、GetHeight()、setHeight()。声明一个box对象，观察构造函数
Accelerated C++ 课后练习精选答案
在所不辞的博客
02-06 4197
目录 第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...
Accelerated C++ 习题解答 第11章
u013706695的专栏
04-01 844
EX.11-0 #ifndef VEC_H #define VEC_H #include #include #include using std::max; template class Vec { public: typedef T* iterator; typedef const T* const_iterator; typedef size_t size_type;
CSAPP第七章家庭作业参考答案
Talk is cheap,give me the code!
01-22 7032
（CSAPP第三版系列）导航篇传送门 7.6这道题是关于图7-5的m.o模块和swap.c函数版本的。 符号 swap.o.symtab条目 符号类型 定义符号的模块 节 buf 是 外部 m.o .data bufp0 是 全
Accelerated C++：通过示例进行编程实践——练习解答（第12章）
CSAP
10-31 1391
12-0. Compile, execute, and test the programs in this chapter. 12-1. Reimplement the Str class, but choose an implementation strategy that requires that the class manage the storage itself. For examp
Accelerated C++ 习题解答 第12章
u013706695的专栏
04-05 567
参考了网上已有解答
Accelerated C++ 习题解答 第1章
u013706695的专栏
02-19 1982
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++: 实战编程指南
"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、付费专栏及课程。

余额充值