存量题库数据更新

leetcode-cn/problem (English)/可能的二分法(English) [possible-bipartition].html

@@ -3,26 +3,20 @@
 <p>Given the integer <code>n</code> and the array <code>dislikes</code> where <code>dislikes[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that the person labeled <code>a<sub>i</sub></code> does not like the person labeled <code>b<sub>i</sub></code>, return <code>true</code> <em>if it is possible to split everyone into two groups in this way</em>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> n = 4, dislikes = [[1,2],[1,3],[2,4]]
 <strong>Output:</strong> true
-<strong>Explanation:</strong> group1 [1,4] and group2 [2,3].
+<strong>Explanation:</strong> The first group has [1,4], and the second group has [2,3].
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> n = 3, dislikes = [[1,2],[1,3],[2,3]]
 <strong>Output:</strong> false
-</pre>
-
-<p><strong>Example 3:</strong></p>
-
-<pre>
-<strong>Input:</strong> n = 5, dislikes = [[1,2],[2,3],[3,4],[4,5],[1,5]]
-<strong>Output:</strong> false
+<strong>Explanation:</strong> We need at least 3 groups to divide them. We cannot put them in two groups.
 </pre>
 
 <p>&nbsp;</p>
@@ -32,7 +26,6 @@
 	<li><code>1 &lt;= n &lt;= 2000</code></li>
 	<li><code>0 &lt;= dislikes.length &lt;= 10<sup>4</sup></code></li>
 	<li><code>dislikes[i].length == 2</code></li>
-	<li><code>1 &lt;= dislikes[i][j] &lt;= n</code></li>
-	<li><code>a<sub>i</sub> &lt; b<sub>i</sub></code></li>
+	<li><code>1 &lt;= a<sub>i</sub> &lt; b<sub>i</sub> &lt;= n</code></li>
 	<li>All the pairs of <code>dislikes</code> are <strong>unique</strong>.</li>
 </ul>