C/C++基础学习代码(4)

程序1.

//使用迭代器寻找和删除string对象中所有的大写字母
#include <iostream>
#include <string>

using namespace std;

int main()
{
    string str1("fhAsiSEFrh");
    string::iterator first = str1.begin();

    while(first != str1.end())
    {
        if(isupper(*first) )
        {
            str1.erase (first);
            //因为erase后，返回指向被删除元素后面的迭代器
            --first;
        }
        ++first;
    }

    cout << str1 << endl;

    return 0;
}
/****输出****
fhsirh
************/

程序2.

/*
*已知string对象：line1,line2,line3;
*编写程序计算sentence中有多少个单词，
*并指出其中最长和最短的单词。
*如果有多个最长或最短的单词，
*则将它们全部输出。
*/
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
    string line1="We were her pride of 10 she named us:";
    string line2="Benjamin, Phoenix, the Prodigal";
    string line3="and perspicacious pacific Suzanne";
    string sentence=line1+' '+line2+' '+line3;
    string separators(" \t:,\v\r\n\f");
    string word;
    string::size_type maxLen,minLen,wordLen,count=0;
    vector<string> longestWords,shortestWords;
    string::size_type startPos=0,endPos=0;
    while((startPos=sentence.find_first_not_of(separators,endPos))!=string::npos){
            //找到下个单词的起始位置
            ++count;
            //找到下个单词的结束位置
            endPos=sentence.find_first_of(separators,startPos);
            if(endPos==string::npos) //如果为最后一个单词
                wordLen=sentence.size()-startPos;
            else
                wordLen=endPos-startPos;

            word.assign(sentence.begin()+startPos,
                sentence.begin()+startPos+wordLen);//获取单词

            if(count==1) {//找到是第一个单词
                maxLen=wordLen;
                minLen=wordLen;
                longestWords.push_back(word);
                shortestWords.push_back(word);
            }
            else{
                if(wordLen>maxLen){
                    maxLen=wordLen;
                    longestWords.clear();
                    longestWords.push_back(word);
                }
                else if(wordLen==maxLen)
                    longestWords.push_back(word);
                if(wordLen<minLen){
                    minLen=wordLen;
                    shortestWords.clear();
                    shortestWords.push_back(word);
                }
                else if(wordLen==minLen){
                    shortestWords.push_back(word);
                }
            }
    }

    cout << "word amount: " << count << endl;

    vector<string>::iterator iter;
    cout << "longest word(s):" << endl;
    iter=longestWords.begin();
    while(iter!=longestWords.end())
        cout << *iter++ << endl;

    cout << "shortest word(s):" << endl;
    iter=shortestWords.begin();
    while(iter!=shortestWords.end())
        cout << *iter++ << endl;

    return 0;
}