题解 | #查找学生信息#
查找学生信息
https://www.nowcoder.com/practice/fe8bff0750c8448081759f3ee0d86bb4
#include <iostream> #include <vector> using namespace std; struct node { string id; string name; string sex; int age; }; int main() { int n; cin >> n; vector<node> s(n); for (int i = 0 ; i < n ; i++) { cin >> s[i].id >> s[i].name >> s[i].sex >> s[i].age; } int m; cin >> m; while(m--) { string t ; bool isfind = false; cin >> t; for (int i = 0 ; i < n ; i++) { if (s[i].id == t) { cout << s[i].id << " " << s[i].name << " " << s[i].sex << " " << s[i].age << endl; isfind = true; } } if(!isfind) cout << "No Answer!" << endl; } }#算法#