C++解法
2.人数最多的站点:
地铁从起始站点出发,途径一些站点,最后回到起始站点,给出n个乘客,并记录他们上车站点和下车站点(站点用数字表示),求人数最多的站点,如果有多个站点最大人数相同,则返回站点数最小的站。
例:
输入:
3
1 3
2 4
1 4
输出:
2
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, up, down, start = 1000, end = 0, man = 0, pos = 1000;
cin >> n;
map<int, int> post;
vector<int> tmp;
while (n > 0) {
cin >> up >> down;
start = min(min(start, up), down);
end = max(max(end, up), down);
if (up < down) {
for (int i = up; i <= down; i++)
post[i]++;
}
else {
tmp.push_back(up);
tmp.push_back(down);
}
n--;
}
for (int i = 0; i < tmp.size(); i++) {
for (int j = tmp[0]; j <= end; j++)
post[j]++;
for (int j = tmp[1]; j >= start; j--)
post[j]++;
tmp.erase(tmp.begin(), tmp.begin() + 2);
}
for (auto i : post) {
int comparision = man;
man = max(i.second, man);
if (comparision != man) {
pos = i.first;
}
}
cout << pos << endl;
}