Skip to content

Commit 8167109

Browse files
committed
Create README - LeetHub
1 parent ac8f03f commit 8167109

1 file changed

Lines changed: 7 additions & 5 deletions

File tree

1626-best-team-with-no-conflicts/README.md

Lines changed: 7 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
<h2><a href="https://leetcode.com/problems/best-team-with-no-conflicts/">1626. Best Team With No Conflicts</a></h2><h3>Medium</h3><hr><div><p>You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the <strong>sum</strong> of scores of all the players in the team.</p>
1+
<h2><a href="https://leetcode.com/problems/best-team-with-no-conflicts">1748. Best Team With No Conflicts</a></h2><h3>Medium</h3><hr><p>You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the <strong>sum</strong> of scores of all the players in the team.</p>
22

33
<p>However, the basketball team is not allowed to have <strong>conflicts</strong>. A <strong>conflict</strong> exists if a younger player has a <strong>strictly higher</strong> score than an older player. A conflict does <strong>not</strong> occur between players of the same age.</p>
44

@@ -7,21 +7,24 @@
77
<p>&nbsp;</p>
88
<p><strong class="example">Example 1:</strong></p>
99

10-
<pre><strong>Input:</strong> scores = [1,3,5,10,15], ages = [1,2,3,4,5]
10+
<pre>
11+
<strong>Input:</strong> scores = [1,3,5,10,15], ages = [1,2,3,4,5]
1112
<strong>Output:</strong> 34
1213
<strong>Explanation:</strong>&nbsp;You can choose all the players.
1314
</pre>
1415

1516
<p><strong class="example">Example 2:</strong></p>
1617

17-
<pre><strong>Input:</strong> scores = [4,5,6,5], ages = [2,1,2,1]
18+
<pre>
19+
<strong>Input:</strong> scores = [4,5,6,5], ages = [2,1,2,1]
1820
<strong>Output:</strong> 16
1921
<strong>Explanation:</strong>&nbsp;It is best to choose the last 3 players. Notice that you are allowed to choose multiple people of the same age.
2022
</pre>
2123

2224
<p><strong class="example">Example 3:</strong></p>
2325

24-
<pre><strong>Input:</strong> scores = [1,2,3,5], ages = [8,9,10,1]
26+
<pre>
27+
<strong>Input:</strong> scores = [1,2,3,5], ages = [8,9,10,1]
2528
<strong>Output:</strong> 6
2629
<strong>Explanation:</strong>&nbsp;It is best to choose the first 3 players.
2730
</pre>
@@ -35,4 +38,3 @@
3538
<li><code>1 &lt;= scores[i] &lt;= 10<sup>6</sup></code></li>
3639
<li><code>1 &lt;= ages[i] &lt;= 1000</code></li>
3740
</ul>
38-
</div>

0 commit comments

Comments
 (0)