g0801_0900.s0825_friends_of_appropriate_ages.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0801_0900.s0825_friends_of_appropriate_ages;
// #Medium #Array #Sorting #Binary_Search #Two_Pointers
// #2022_03_23_Time_3_ms_(87.71%)_Space_57.5_MB_(36.15%)
public class Solution {
public int numFriendRequests(int[] ages) {
int[] counter = new int[121];
for (int k : ages) {
counter[k]++;
}
int result = 0;
for (int k = 15; k < counter.length; k++) {
if (counter[k] == 0) {
continue;
}
result += counter[k] * (counter[k] - 1);
for (int y = k - 1; y > k / 2.0 + 7; y--) {
result += counter[k] * counter[y];
}
}
return result;
}
}