算法分析与设计之C++STL

C++ 迭代器 容器

#include
#include
#include
#include
using namespace std;
int main(){
    int n;
    while(cin>>n&&n)
    {
        map Balloon;
        string s;
        for(int i=0;i> s;
            Balloon[s]++;
        }

        int iMax = 0;
        map::iterator point,loc;
        for(point = Balloon.begin();point!=Balloon.end();point++)
        {
            if(iMaxsecond)
            {
                iMax = point->second;
                loc = point;
            }
        }
        cout<first<
#include
#include
using namespace std;
void display(vector &v);
int main(){
    cout<<"Hello"< v,v2(10);
    cout<<"v1 length:"< &v)
{
    
}

你可能感兴趣的:(c++)