Skip to content

Create Count the number of fair prices #944

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Sudo-Aditi wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Create Count the number of fair prices #944

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions Count the number of fair prices
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
A VERY NICE implementation of BINARY SEARCH TO BE LEARNT HERE

class Solution {
public:
long long countFairPairs(vector<int>& nums, int lower, int upper) {
long long int ans = 0;
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size()-1;i++){
long long int l = lower-nums[i];
long long int h = upper-nums[i];
long long int l_b = lower_bound(nums.begin()+i+1,nums.end(),l)-nums.begin();
long long int u_b = upper_bound(nums.begin()+i+1,nums.end(),h)-nums.begin();

ans += (u_b - l_b);
}
return ans;
}
};