mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
45 lines
1.5 KiB
HTML
45 lines
1.5 KiB
HTML
<p>There are <code>n</code> soldiers standing in a line. Each soldier is assigned a <strong>unique</strong> <code>rating</code> value.</p>
|
|
|
|
<p>You have to form a team of 3 soldiers amongst them under the following rules:</p>
|
|
|
|
<ul>
|
|
<li>Choose 3 soldiers with index (<code>i</code>, <code>j</code>, <code>k</code>) with rating (<code>rating[i]</code>, <code>rating[j]</code>, <code>rating[k]</code>).</li>
|
|
<li>A team is valid if: (<code>rating[i] < rating[j] < rating[k]</code>) or (<code>rating[i] > rating[j] > rating[k]</code>) where (<code>0 <= i < j < k < n</code>).</li>
|
|
</ul>
|
|
|
|
<p>Return the number of teams you can form given the conditions. (soldiers can be part of multiple teams).</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> rating = [2,5,3,4,1]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> We can form three teams given the conditions. (2,3,4), (5,4,1), (5,3,1).
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> rating = [2,1,3]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> We can't form any team given the conditions.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> rating = [1,2,3,4]
|
|
<strong>Output:</strong> 4
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == rating.length</code></li>
|
|
<li><code>3 <= n <= 1000</code></li>
|
|
<li><code>1 <= rating[i] <= 10<sup>5</sup></code></li>
|
|
<li>All the integers in <code>rating</code> are <strong>unique</strong>.</li>
|
|
</ul>
|