diff options
author | Jack Sangdahl <[email protected]> | 2025-04-19 00:06:47 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-04-19 00:06:47 -0600 |
commit | 2e01488b5f45d49e16b116f2b0c858c69bd0dd26 (patch) | |
tree | 51764da336ff6fa61711fd94095622ced8bd89e8 /count_num_fair_pairs.py | |
parent | e8ccee285b5d5665cc3d3800c163e942c67c435d (diff) | |
download | leetcode-2e01488b5f45d49e16b116f2b0c858c69bd0dd26.tar.gz leetcode-2e01488b5f45d49e16b116f2b0c858c69bd0dd26.zip |
2563. count the number of fair pairs
Diffstat (limited to 'count_num_fair_pairs.py')
-rw-r--r-- | count_num_fair_pairs.py | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/count_num_fair_pairs.py b/count_num_fair_pairs.py index 5933dbd..8d02562 100644 --- a/count_num_fair_pairs.py +++ b/count_num_fair_pairs.py @@ -19,9 +19,8 @@ class Solution(object): nums.sort() ans = 0 for i in range(len(nums) - 1, -1, -1): - v = nums[i] - a = bisect.bisect_left(nums, lower - v, lo=0, hi=i) - b = bisect.bisect_right(nums, upper - v, lo=0, hi=i) + a = bisect.bisect_left(nums, lower - nums[i], i + 1) + b = bisect.bisect_right(nums, upper - nums[i], i + 1) ans += b - a return ans |