coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 10:51:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-08-10 21:35:14 +08:00
parent dee13a03bd
commit f6b8cd3b4b
81 changed files with 19629 additions and 9957 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
leetcode-cn/problem (Chinese)/统计梯形的数目 I [count-number-of-trapezoids-i].html Normal file
View File

@@ -0,0 +1,53 @@
<p data-end="189" data-start="146">给你一个二维整数数组 <code>points</code>，其中 <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> 表示第 <code>i</code> 个点在笛卡尔平面上的坐标。</p>
<p data-end="579" data-start="405"><strong>水平梯形</strong> 是一种凸四边形，具有&nbsp;<strong data-end="496" data-start="475">至少一对&nbsp;</strong>水平边（即平行于 x 轴的边）。两条直线平行当且仅当它们的斜率相同。</p>
<p data-end="579" data-start="405">返回可以从 <code>points</code> 中任意选择四个不同点组成的&nbsp;<strong>水平梯形 </strong>数量。</p>
<p>由于答案可能非常大，请返回结果对 <code>10<sup>9</sup> + 7</code> 取余数后的值。</p>
<p>&nbsp;</p>
<p><strong class="example">示例 1：</strong></p>
<div class="example-block">
<p><strong>输入：</strong> <span class="example-io">points = [[1,0],[2,0],[3,0],[2,2],[3,2]]</span></p>
<p><strong>输出：</strong> <span class="example-io">3</span></p>
<p><strong>解释：</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2025/05/01/desmos-graph-6.png" style="width: 250px; height: 250px;" /> <img alt="" src="https://assets.leetcode.com/uploads/2025/05/01/desmos-graph-7.png" style="width: 250px; height: 250px;" /> <img alt="" src="https://assets.leetcode.com/uploads/2025/05/01/desmos-graph-8.png" style="width: 250px; height: 250px;" /></p>
<p>有三种不同方式选择四个点组成一个水平梯形：</p>
<ul>
<li data-end="247" data-start="193">使用点 <code data-end="213" data-start="206">[1,0]</code>、<code data-end="222" data-start="215">[2,0]</code>、<code data-end="231" data-start="224">[3,2]</code> 和 <code data-end="244" data-start="237">[2,2]</code>。</li>
<li data-end="305" data-start="251">使用点 <code data-end="271" data-start="264">[2,0]</code>、<code data-end="280" data-start="273">[3,0]</code>、<code data-end="289" data-start="282">[3,2]</code> 和 <code data-end="302" data-start="295">[2,2]</code>。</li>
<li data-end="361" data-start="309">使用点 <code data-end="329" data-start="322">[1,0]</code>、<code data-end="338" data-start="331">[3,0]</code>、<code data-end="347" data-start="340">[3,2]</code> 和 <code data-end="360" data-start="353">[2,2]</code>。</li>
</ul>
</div>
<p><strong class="example">示例 2：</strong></p>
<div class="example-block">
<p><strong>输入：</strong> <span class="example-io">points = [[0,0],[1,0],[0,1],[2,1]]</span></p>
<p><strong>输出：</strong> <span class="example-io">1</span></p>
<p><strong>解释：</strong></p>
<p><img alt="" src="https://assets.leetcode.com/uploads/2025/04/29/desmos-graph-5.png" style="width: 250px; height: 250px;" /></p>
<p>只有一种方式可以组成一个水平梯形。</p>
</div>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>4 &lt;= points.length &lt;= 10<sup>5</sup></code></li>
<li><code>–10<sup>8</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>8</sup></code></li>
<li>所有点两两不同。</li>
</ul>