Skip to content

Latest commit

 

History

History
123 lines (99 loc) · 1.98 KB

File metadata and controls

123 lines (99 loc) · 1.98 KB
title subtitle date lastmod draft author authorLink description license images tags categories featuredImage featuredImagePreview hiddenFromHomePage hiddenFromSearch twemoji lightgallery ruby fraction fontawesome linkToMarkdown rssFullText toc code math mapbox share comment library seo
0217.Contains-Duplicate
2023-01-22 21:20:00 +0800
2023-01-22 21:20:00 +0800
false
Kimi.Tsai
Contains Duplicate
LeetCode
Go
Easy
Contains Duplicate
Array
Blind75
LeetCode
false
false
false
true
true
true
true
false
false
enable auto
true
true
copy maxShownLines
true
200
enable
enable
true
enable
true
css js
images

題目

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

題目大意

解題思路

來源

解答

https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0217.Contains-Duplicate/main.go

package containsduplicate

func ContainsDuplicate(nums []int) bool {
	numsMap := make(map[int]bool, len(nums))
	for _, v := range nums {
		if numsMap[v] {
			return true
		}
		numsMap[v] = true
	}
	return false
}

Benchmark