mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
30 lines
742 B
HTML
30 lines
742 B
HTML
|
<p>给定由一些正数（代表长度）组成的数组 <code>nums</code> ，返回 <em>由其中三个长度组成的、<strong>面积不为零</strong>的三角形的最大周长</em> 。如果不能形成任何面积不为零的三角形，返回 <code>0</code>。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<ol>
|
|||
|
|
</ol>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [2,1,2]
|
|||
|
|
<strong>输出：</strong>5
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [1,2,1]
|
|||
|
|
<strong>输出：</strong>0
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>3 <= nums.length <= 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>1 <= nums[i] <= 10<sup>6</sup></code></li>
|
|||
|
|
</ul>
|