diff --git a/217. Contains Duplicate.md b/217. Contains Duplicate.md
new file mode 100644
index 0000000..7a783b0
--- /dev/null
+++ b/217. Contains Duplicate.md	
@@ -0,0 +1,15 @@
+# [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/)
+# 思路
+先对数组进行排序，排序后重复的数一定是相邻的，再遍历一遍即可。
+# C++
+```
+class Solution {
+public:
+    bool containsDuplicate(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        for(int i = 1; i < nums.size(); i++)
+            if(nums[i] == nums[i-1]) return true;
+        return false;
+    }
+};
+```