def numFriendRequests(ages):
n = len(ages)
ages.sort()
left = right = ans = 0
for age in ages:
if age < 15:
continue
# 找到满足第一个条件的前一个age
while ages[left] < 0.5 * age + 7:
left += 1
# 找到满足第二个条件的最后一个age
while ages[right] < n and ages[right + 1] <= age:
right += 1
ans += right - left
return ans
LeetCode 825 适龄的朋友
最新推荐文章于 2024-07-19 22:53:00 发布