update: 217

Author: hijiangtao

README.md

@@ -132,7 +132,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | [JavaScript](./src/course-schedule-ii/res.js) | Medium |
 | 213 | [house-robber-ii](https://leetcode.com/problems/house-robber-ii/) | [TypeScript](./src/house-robber-ii/res.ts) | Medium |
 | 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [JavaScript](./src/kth-largest-element-in-an-array/res.js) | Medium |
-| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [JavaScript](./src/contains-duplicate/res.js)  | Easy |
+| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [JavaScript](./src/contains-duplicate/res.js) · [TypeScript](./src/contains-duplicate/res.ts) | Easy |
 | 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [JavaScript](./src/contains-duplicate-ii/res.js) | Easy |
 | 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | [JavaScript](./src/contains-duplicate-iii/res.js) | Medium |
 | 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/solution/) | [JavaScript](./src/summary-ranges/res.js) | Medium |

src/contains-duplicate/res.ts

@@ -0,0 +1,15 @@
+function containsDuplicate(nums: number[]): boolean {
+if (nums.length < 2) {
+return false;
+}
+
+nums.sort((a, b) => a - b);
+
+for (let i = 1; i < nums.length; i++) {
+if (nums[i] === nums[i-1]) {
+return true;
+}
+}
+
+return false;
+};