mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
42 lines
1.8 KiB
HTML
42 lines
1.8 KiB
HTML
给你一个下标从 <strong>0</strong> 开始长度为 <code>n</code> 的整数数组 <code>nums</code> 和一个整数 <code>target</code> ,请你返回满足 <code>0 <= i < j < n</code> 且 <code>nums[i] + nums[j] < target</code> 的下标对 <code>(i, j)</code> 的数目。
|
||
<p> </p>
|
||
|
||
<p><strong class="example">示例 1:</strong></p>
|
||
|
||
<pre>
|
||
<b>输入:</b>nums = [-1,1,2,3,1], target = 2
|
||
<b>输出:</b>3
|
||
<b>解释:</b>总共有 3 个下标对满足题目描述:
|
||
- (0, 1) ,0 < 1 且 nums[0] + nums[1] = 0 < target
|
||
- (0, 2) ,0 < 2 且 nums[0] + nums[2] = 1 < target
|
||
- (0, 4) ,0 < 4 且 nums[0] + nums[4] = 0 < target
|
||
注意 (0, 3) 不计入答案因为 nums[0] + nums[3] 不是严格小于 target 。
|
||
</pre>
|
||
|
||
<p><strong class="example">示例 2:</strong></p>
|
||
|
||
<pre>
|
||
<b>输入:</b>nums = [-6,2,5,-2,-7,-1,3], target = -2
|
||
<b>输出:</b>10
|
||
<b>解释:</b>总共有 10 个下标对满足题目描述:
|
||
- (0, 1) ,0 < 1 且 nums[0] + nums[1] = -4 < target
|
||
- (0, 3) ,0 < 3 且 nums[0] + nums[3] = -8 < target
|
||
- (0, 4) ,0 < 4 且 nums[0] + nums[4] = -13 < target
|
||
- (0, 5) ,0 < 5 且 nums[0] + nums[5] = -7 < target
|
||
- (0, 6) ,0 < 6 且 nums[0] + nums[6] = -3 < target
|
||
- (1, 4) ,1 < 4 且 nums[1] + nums[4] = -5 < target
|
||
- (3, 4) ,3 < 4 且 nums[3] + nums[4] = -9 < target
|
||
- (3, 5) ,3 < 5 且 nums[3] + nums[5] = -3 < target
|
||
- (4, 5) ,4 < 5 且 nums[4] + nums[5] = -8 < target
|
||
- (4, 6) ,4 < 6 且 nums[4] + nums[6] = -4 < target
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示:</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= nums.length == n <= 50</code></li>
|
||
<li><code>-50 <= nums[i], target <= 50</code></li>
|
||
</ul>
|