g0201_0300.s0217_contains_duplicate.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation
Show all versions of leetcode-in-kotlin Show documentation
Kotlin-based LeetCode algorithm problem solutions, regularly updated
217\. Contains Duplicate
Easy
Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.
**Example 1:**
**Input:** nums = [1,2,3,1]
**Output:** true
**Example 2:**
**Input:** nums = [1,2,3,4]
**Output:** false
**Example 3:**
**Input:** nums = [1,1,1,3,3,4,3,2,4,2]
**Output:** true
**Constraints:**
* 1 <= nums.length <= 105
* -109 <= nums[i] <= 109