/**
* 217_ContainsDuplicate.js
* Easy
* https://leetcode.com/problems/contains-duplicate/
* @param {number[]} nums
* @return {boolean}
*/
var containsDuplicate = function(nums) {
const numHash = {};
for (let i = 0; i < nums.length; i++) {
if (!numHash[nums[i]]) {
numHash[nums[i]] = 1;
} else {
return true;
}
}
return false;
};
module.exports.containsDuplicate = containsDuplicate;
간단한 해시로 확인
/**
* 217_ContainsDuplicate.test.js
*/
const { containsDuplicate } = require("./217_ContainsDuplicate");
test('[1,2,3,1]', () => {
expect(containsDuplicate([1,2,3,1])).toBe(true);
});
test('[1,2,3,4]', () => {
expect(containsDuplicate([1,2,3,4])).toBe(false);
});
test('[1,1,1,3,3,4,3,2,4,2]', () => {
expect(containsDuplicate([1,1,1,3,3,4,3,2,4,2])).toBe(true);
});
'알고리즘 > LeetCode' 카테고리의 다른 글
[Leetcode][자바스크립트][Easy] 88. Merge Sorted Array (0) | 2022.01.06 |
---|---|
[Leetcode][자바스크립트][Easy] 53. Maximum Subarray (0) | 2022.01.05 |
[Leetcode][Javascript][Easy] 118. Pascals Triangle (0) | 2021.07.10 |
[Leetcode][Javascript][Medium] 718. Maximum Length of Repeated Subarray (0) | 2021.07.09 |
[Leetcode][Javascript][Easy] 202. Happy Number (0) | 2021.07.08 |
댓글