描述 | |
---|---|
知识点 | 字符串 |
运行时间限制 | 0M |
内存限制 | 0 |
输入 | 一行或多行字符串。每行包括带路径文件名称,行号,以空格隔开。
如:E:\V1R2\product\fpgadrive.c 1325 |
输出 | 将所有的记录统计并将结果输出,格式:文件名 代码行数 数目,一个空格隔开,如:
fpgadrive.c 1325 1 |
样例输入 | E:\V1R2\product\fpgadrive.c 1325 |
样例输出 | fpgadrive.c 1325 1 |
<pre name="code" class="cpp">#include<iostream>
#include<queue>
#include<map>
#include<string>
using namespace std;
int main()
{
string s,tmp,line;
map<string,int> imap;
queue<string> sq;
int posleft,posright,len,spaceleft;
while(cin>>s>>line)
{
posleft=s.find_last_of('\\');
s=s.substr(posleft+1); //将文件名求出
len=s.size();
if(len>16)
tmp=s.substr(len-16,16)+" "+line;
else
tmp=s.substr(0,len)+" "+line;
imap[tmp]++;
if(imap[tmp]==1)
sq.push(tmp);
if(sq.size()>8)
//imap.erase(sq.front());问题出在这
sq.pop();
}
while(!sq.empty())
{
cout<<sq.front()<<" "<<imap[sq.front()]<<endl;
sq.pop();
}
//system("pause");
return 0;
}
下面基于未封装的类是OJ下面别的同学实现的,感觉体现了C++的类的思想,挺好的,也贴出来跟大家分享:
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
class record
{
public:
string name;
int line;
int count;
record()
{
count = 1;
name = "";
line = -1;
}
void setName();
bool query( record q );
void output();
};
void record::setName()
{
int pos = name.find( '\\') ;
while( pos != string::npos )
{
name.erase( 0, pos + 1 );
pos = name.find( '\\' );
}//end while
}//end setName
bool record::query( record q )
{
if( q.name == name && q.line == line )
return true;
return false;
}//end queryName
void record::output()
{
int temp = name.length();
//cout<<name.substr( temp - 16,16 )<<" "<<line<<" "<<count<<endl;
if( name.length() <= 16 )
cout<<name<<" "<<line<<" "<<count<<endl;
else
cout<<name.substr( temp - 16,16 )<<" "<<line<<" "<<count<<endl;
}
//end output
int main()
{
vector<record> input;
string inputname;
int line;
while( cin>>inputname>>line )
{
//cin>>inputname>>line;
record temp;
temp.name = inputname;
temp.line = line;
temp.setName();
if( !input.empty() )
{
bool query = false;
for( int i = 0; i < input.size(); i++ )
if( input[ i ].query( temp ) )
{
query = true;
input[ i ].count++;
break;
} //end if
if( !query )
input.push_back( temp );
}//end if
else
{
input.push_back( temp );
}//end else
}//end while
if( input.size() <= 8 )
{
for( int i = 0; i < input.size(); i++ )
input[ i ].output();
}//end if
else
{
for( int i = input.size() - 8; i < input.size(); i++ )
input[ i ].output();
}//end else
//system( "pause" );
return 0;
}//end main