Closed dak2 closed 9 months ago
https://leetcode.com/problems/contains-duplicate/
https://leetcode.com/problems/contains-duplicate/solutions/3672475/4-method-s-c-java-python-beginner-friendly
https://github.com/dak2/LeetCode/pull/1/commits/4761ade3913ede96dee396300d529ff59421852d だと O(N^2) でTime Limit Exceedになるので、Hash Mapを使ってO(N)にする
Problem
https://leetcode.com/problems/contains-duplicate/
Ans
https://leetcode.com/problems/contains-duplicate/solutions/3672475/4-method-s-c-java-python-beginner-friendly