1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

This commit is contained in:
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions

View File

@@ -5,7 +5,7 @@
<p>Return <em>the number of <strong>weak</strong> characters</em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> properties = [[5,5],[6,3],[3,6]]
@@ -13,7 +13,7 @@
<strong>Explanation:</strong> No character has strictly greater attack and defense than the other.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> properties = [[2,2],[3,3]]
@@ -21,7 +21,7 @@
<strong>Explanation:</strong> The first character is weak because the second character has a strictly greater attack and defense.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> properties = [[1,5],[10,4],[4,3]]