aboutsummaryrefslogtreecommitdiff
path: root/contains_duplicate.cpp
diff options
context:
space:
mode:
authorjack <[email protected]>2024-06-14 13:13:15 -0600
committerjack <[email protected]>2024-06-14 13:13:15 -0600
commitd343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch)
tree96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /contains_duplicate.cpp
downloadleetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz
leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip
initial
Diffstat (limited to 'contains_duplicate.cpp')
-rw-r--r--contains_duplicate.cpp22
1 files changed, 22 insertions, 0 deletions
diff --git a/contains_duplicate.cpp b/contains_duplicate.cpp
new file mode 100644
index 0000000..5de86d2
--- /dev/null
+++ b/contains_duplicate.cpp
@@ -0,0 +1,22 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ bool containsDuplicate(vector<int> &nums) {
+ bool ans = false;
+ for (int i = 0; i < nums.size(); i++)
+ for (int j = i + 1; j < nums.size(); j++)
+ if (nums[i] == nums[j])
+ ans = true;
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> nums1 = {1, 2, 3, 1}, nums2 = {1, 2, 3, 4},
+ nums3 = {1, 1, 1, 3, 3, 4, 3, 2, 4, 2};
+ cout << obj.containsDuplicate(nums1) << endl; // expect: 1
+ cout << obj.containsDuplicate(nums2) << endl; // expect: 0
+ cout << obj.containsDuplicate(nums3) << endl; // expect: 1
+}