批量更新数据

leetcode-cn/problem (English)/判断一个数组是否可以变为有序(English) [find-if-array-can-be-sorted].html

@@ -2,7 +2,7 @@
 
 <p>In one <strong>operation</strong>, you can swap any two <strong>adjacent</strong> elements if they have the <strong>same</strong> number of <span data-keyword="set-bit">set bits</span>. You are allowed to do this operation <strong>any</strong> number of times (<strong>including zero</strong>).</p>
 
-<p>Return <code>true</code> <em>if you can sort the array, else return </em><code>false</code>.</p>
+<p>Return <code>true</code> <em>if you can sort the array in ascending order, else return </em><code>false</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>