Commit 5dcec72

committed

update: 217

1 parent 38a3c48 commit 5dcec72Copy full SHA for 5dcec72

File tree

+16

-1

lines changed

+16

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -132,7 +132,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`132`	`132`	`\| 210 \| [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) \| [JavaScript](./src/course-schedule-ii/res.js) \| Medium \|`
`133`	`133`	`\| 213 \| [house-robber-ii](https://leetcode.com/problems/house-robber-ii/) \| [TypeScript](./src/house-robber-ii/res.ts) \| Medium \|`
`134`	`134`	`\| 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 \|`
`135`		`-\| 217 \| [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) \| [JavaScript](./src/contains-duplicate/res.js) \| Easy \|`
	`135`	`+\| 217 \| [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) \| [JavaScript](./src/contains-duplicate/res.js) · [TypeScript](./src/contains-duplicate/res.ts) \| Easy \|`
`136`	`136`	`\| 219 \| [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) \| [JavaScript](./src/contains-duplicate-ii/res.js) \| Easy \|`
`137`	`137`	`\| 220 \| [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) \| [JavaScript](./src/contains-duplicate-iii/res.js) \| Medium \|`
`138`	`138`	`\| 228 \| [Summary Ranges](https://leetcode.com/problems/summary-ranges/solution/) \| [JavaScript](./src/summary-ranges/res.js) \| Medium \|`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+function containsDuplicate(nums: number[]): boolean {`
	`2`	`+ if (nums.length < 2) {`
	`3`	`+ return false;`
	`4`	`+ }`
	`5`	`+`
	`6`	`+ nums.sort((a, b) => a - b);`
	`7`	`+`
	`8`	`+ for (let i = 1; i < nums.length; i++) {`
	`9`	`+ if (nums[i] === nums[i-1]) {`
	`10`	`+ return true;`
	`11`	`+ }`
	`12`	`+ }`
	`13`	`+`
	`14`	`+ return false;`
	`15`	`+};`

Comments

(0)