@@ -0,0 +1,529 @@
+/**%0A * https://leetcode.com/problems/contains-duplicate/%0A * Given an array of integers, find if the array contains any duplicates. %0A * Your function should return true if any value appears at least twice in the array, %0A * and it should return false if every element is distinct.%0A */%0Apublic class Solution %7B%0A%09public boolean containsDuplicate(int%5B%5D nums) %7B%0A%09%09if (nums.length == 0)%0A%09%09%09return false;%0A%0A%09%09HashSet%3CInteger%3E set = new HashSet();%0A%09%09for(int element : nums)%0A%09%09%09set.add(element);%0A%0A%09%09return !(set.size() == nums.length);%0A%09%7D%0A%7D%0A

Create 217_Contains_Duplicate.java