We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9401aaa commit a457daeCopy full SHA for a457dae
contains-duplicate/yeongu.cpp
@@ -1,3 +1,6 @@
1
+// Time complexity: o(n log n) 왜냐하면, for 문이 n이고 find 연산이 log n이기 때문.
2
+// Space complexity: O(n) 왜냐하면, 다 다른경우 n
3
+
4
class Solution {
5
public:
6
bool containsDuplicate(vector<int>& nums) {
0 commit comments