mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-12-18 02:02:34 +08:00
41 lines
1.4 KiB
HTML
41 lines
1.4 KiB
HTML
<p>给你一个整数数组 <code>nums</code>。</p>
|
||
|
||
<p>从 <code>nums</code> 中选择三个元素 <code>a</code>、<code>b</code> 和 <code>c</code>,它们的下标需 <strong>互不相同</strong> ,使表达式 <code>a + b - c</code> 的值最大化。</p>
|
||
|
||
<p>返回该表达式可能的<strong> 最大值 </strong>。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong class="example">示例 1:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入:</strong> <span class="example-io">nums = [1,4,2,5]</span></p>
|
||
|
||
<p><strong>输出:</strong> <span class="example-io">8</span></p>
|
||
|
||
<p><strong>解释:</strong></p>
|
||
|
||
<p>可以选择 <code>a = 4</code>,<code>b = 5</code>,<code>c = 1</code>。表达式的值为 <code>4 + 5 - 1 = 8</code>,这是可能的最大值。</p>
|
||
</div>
|
||
|
||
<p><strong class="example">示例 2:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入:</strong> <span class="example-io">nums = [-2,0,5,-2,4]</span></p>
|
||
|
||
<p><strong>输出:</strong> <span class="example-io">11</span></p>
|
||
|
||
<p><strong>解释:</strong></p>
|
||
|
||
<p>可以选择 <code>a = 5</code>,<code>b = 4</code>,<code>c = -2</code>。表达式的值为 <code>5 + 4 - (-2) = 11</code>,这是可能的最大值。</p>
|
||
</div>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示:</strong></p>
|
||
|
||
<ul>
|
||
<li><code>3 <= nums.length <= 100</code></li>
|
||
<li><code>-100 <= nums[i] <= 100</code></li>
|
||
</ul>
|