Commit 57b0483

ybian19azl397985856

authored and

committed

feat: 219.contains-duplicate-ii add Python3 implementation (azl397985856#128)

1 parent 51ff61d commit 57b0483Copy full SHA for 57b0483

File tree

1 file changed

+35

-19

lines changed

problems
- 219.contains-duplicate-ii.md

1 file changed

+35

-19

lines changed

`‎problems/219.contains-duplicate-ii.md‎`

Lines changed: 35 additions & 19 deletions

Original file line number	Diff line number	Diff line change
`@@ -36,6 +36,10 @@ Output: false`
`36`	`36`
`37`	`37`	`## 代码`
`38`	`38`
	`39`	`+* 语言支持:JS,Python`
	`40`	`+`
	`41`	`+Javascript Code:`
	`42`	`+`
`39`	`43`	```js
`40`	`44`	`/*`
`41`	`45`	`* @lc app=leetcode id=219 lang=javascript`
`@@ -53,34 +57,34 @@ Output: false`
`53`	`57`	`* Given an array of integers and an integer k, find out whether there are two`
`54`	`58`	`* distinct indices i and j in the array such that nums[i] = nums[j] and the`
`55`	`59`	`* absolute difference between i and j is at most k.`
`56`		`- *`
`57`		`- *`
	`60`	`+ *`
	`61`	`+ *`
`58`	`62`	`* Example 1:`
`59`		`- *`
`60`		`- *`
	`63`	`+ *`
	`64`	`+ *`
`61`	`65`	`* Input: nums = [1,2,3,1], k = 3`
`62`	`66`	`* Output: true`
`63`		`- *`
`64`		`- *`
`65`		`- *`
	`67`	`+ *`
	`68`	`+ *`
	`69`	`+ *`
`66`	`70`	`* Example 2:`
`67`		`- *`
`68`		`- *`
	`71`	`+ *`
	`72`	`+ *`
`69`	`73`	`* Input: nums = [1,0,1,1], k = 1`
`70`	`74`	`* Output: true`
`71`		`- *`
`72`		`- *`
`73`		`- *`
	`75`	`+ *`
	`76`	`+ *`
	`77`	`+ *`
`74`	`78`	`* Example 3:`
`75`		`- *`
`76`		`- *`
	`79`	`+ *`
	`80`	`+ *`
`77`	`81`	`* Input: nums = [1,2,3,1,2,3], k = 2`
`78`	`82`	`* Output: false`
`79`		`- *`
`80`		`- *`
`81`		`- *`
`82`		`- *`
`83`		`- *`
	`83`	`+ *`
	`84`	`+ *`
	`85`	`+ *`
	`86`	`+ *`
	`87`	`+ *`
`84`	`88`	`*/`
`85`	`89`	`/**`
`86`	`90`	`* @param {number[]} nums`
`@@ -100,3 +104,15 @@ var containsNearbyDuplicate = function(nums, k) {`
`100`	`104`	`};`
`101`	`105`	```
`102`	`106`
	`107`	`+Python Code:`
	`108`	`+`
	`109`	+```python
	`110`	`+class Solution:`
	`111`	`+ def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:`
	`112`	`+ d = {}`
	`113`	`+ for index, num in enumerate(nums):`
	`114`	`+ if num in d and index - d[num] <= k:`
	`115`	`+ return True`
	`116`	`+ d[num] = index`
	`117`	`+ return False`
	`118`	+```

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 57b0483

File tree

1 file changed

1 file changed

`‎problems/219.contains-duplicate-ii.md‎`

0 commit comments