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

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
leetcode-cn/problem (Chinese)/存在重复元素 [contains-duplicate].html
View File

@@ -1,23 +1,37 @@
给你一个整数数组 <code>nums</code> 。如果任一值在数组中出现 <strong>至少两次</strong> ，返回 <code>true</code> ；如果数组中每个元素互不相同，返回 <code>false</code> 。
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<p><strong class="example">示例 1：</strong></p>
<pre>
<strong>输入：</strong>nums = [1,2,3,1]
<strong>输出：</strong>true</pre>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>nums = [1,2,3,1]</span></p>
<p><strong>示例 2：</strong></p>
<p><span class="example-io"><b>输出：</b>true</span></p>
<pre>
<strong>输入：</strong>nums = [1,2,3,4]
<strong>输出：</strong>false</pre>
<p><strong>解释：</strong></p>
<p><strong>示例&nbsp;3：</strong></p>
<p>元素 1 在下标 0 和 3 出现。</p>
</div>
<pre>
<strong>输入：</strong>nums = [1,1,1,3,3,4,3,2,4,2]
<strong>输出：</strong>true</pre>
<p><strong class="example">示例 2：</strong></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>nums = [1,2,3,4]</span></p>
<p><span class="example-io"><b>输出：</b>false</span></p>
<p><strong>解释：</strong></p>
<p>所有元素都不同。</p>
</div>
<p><strong class="example">示例 3：</strong></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>nums = [1,1,1,3,3,4,3,2,4,2]</span></p>
<p><span class="example-io"><b>输出：</b>true</span></p>
</div>
<p>&nbsp;</p>