1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-14 22:52:36 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
Files
leetcode-problemset/leetcode-cn/problem (English)/三元素表达式的最大值(English) [maximize-expression-of-three-elements].html
2025-12-06 16:04:11 +08:00

39 lines
1.4 KiB
HTML

<p>You are given an integer array <code>nums</code>.</p>
<p>Choose three elements <code>a</code>, <code>b</code>, and <code>c</code> from <code>nums</code> at <strong>distinct</strong> indices such that the value of the expression <code>a + b - c</code> is maximized.</p>
<p>Return an integer denoting the <strong>maximum possible value</strong> of this expression.</p>
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [1,4,2,5]</span></p>
<p><strong>Output:</strong> <span class="example-io">8</span></p>
<p><strong>Explanation:</strong></p>
<p>We can choose <code>a = 4</code>, <code>b = 5</code>, and <code>c = 1</code>. The expression value is <code>4 + 5 - 1 = 8</code>, which is the maximum possible.</p>
</div>
<p><strong class="example">Example 2:</strong></p>
<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [-2,0,5,-2,4]</span></p>
<p><strong>Output:</strong> <span class="example-io">11</span></p>
<p><strong>Explanation:</strong></p>
<p>We can choose <code>a = 5</code>, <code>b = 4</code>, and <code>c = -2</code>. The expression value is <code>5 + 4 - (-2) = 11</code>, which is the maximum possible.</p>
</div>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>3 &lt;= nums.length &lt;= 100</code></li>
<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
</ul>