-
[LeetCode] - contains duplicate (easy / javascript)개발/알고리즘 2022. 6. 21. 00:42
https://leetcode.com/problems/contains-duplicate/
/**
* @param {number[]} nums
* @return {boolean} */
const containsDuplicate = function(nums) {
if (nums.length !== new Set(nums).size) return true;
return false;
};'개발 > 알고리즘' 카테고리의 다른 글
[LeetCode] [ 💩꼭 다시 풀어보기 ] Rotate Array (medium / javascript) (0) 2022.06.21 [LeetCode] Maximum Subarray (easy / javascript) (0) 2022.06.21 [LeetCode] Palindrome Number (easy / javascript) (0) 2021.10.24 [LeetCode] Two Sum (easy / javascript) (0) 2021.06.11 재귀 (Recursion) (0) 2021.04.10