#include <bits/stdc++.h> using namespace std; //typedef long long ll; int main() { int n; cin>>n; string res; for(int i=0;i<=n;i++){ string s1; cin>>s1; if(i==0){ res+=s1; }else{ if(s1[0]==res.back()){ s1.erase(0,1); res+=s1; } } } cout<<res; return 0; }

这道题十分简单，只要运用好string内部的函数就行，废话不多说，上代码！！！ #include <iostream> #include <string> using namespace std; const int MAX_N = 100010; string s[MAX_N]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> s[i]; } string c = s[0]; for (int i = 1; i < n; i++) { if (c.back() == s[i][0]) { c += s[i].substr(1); } } cout << c << endl; return 0; }