暴力做法是O(n^2), 检查所有人两两之间的关系。
优化方案利用年龄单调性,x只会像和他岁数一样或者比他小,到一定范围的人发送请求,因此可以用双指针优化。
class Solution {
public:
int numFriendRequests(vector<int>& ages) {
int n = ages.size();
sort(ages.begin(), ages.end());
int left = 0, right = 0, ans = 0;
for (int age: ages) {
if (age < 15) {
continue;
}
while (ages[left] <= 0.5 * age + 7) {
++left;
}
while (right + 1 < n && ages[right + 1] <= age) {
++right;
}
ans += right - left;
}
return ans;
}
};
class Solution {
public:
int numFriendRequests(vector<int>& ages) {
vector<int> cnt(121);
for (auto age : ages) {
++cnt[age];
}
vector<int> pre(121);
for (int i = 1; i <= 120; i++) {
pre[i] = pre[i - 1] + cnt[i];
}
int res = 0;
for (int i = 15; i <= 120; i++) {
if (cnt[i]) {
int bound = i * 0.5 + 8;
res += cnt[i] * (pre[i] - pre[bound - 1] - 1);
}
}
return res;
}
};