---
tags: AC LeetCode 刷題讀書會 - 2023
---

# 2023/06/11(日) 每週 LeetCode 刷題

## 刷題題號
- [219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)

## 解題思路
Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.
<pre style='background-color:#ggg'>
給予一個整數陣列 nums，和一個整數 k，如果有兩個重複值得索引 i 和 j 在這個陣列中，且符合以下條件，則回傳 true。
1. nums[i] == nums[j]
2. abs(i - j) <= k
</pre>

## 回報格式

- 請 Fork 此 Replit 連結(https://replit.com/@AllenLi23/AC-LeetCode-Js-219-Contains-Duplicate-II)後，進行程式碼解題，並於完成後更新到 Replit 中，再將連結貼至「解題分享區」來與大家交流做法。

解題分享區
---

讀書會議流程：

ex. 21:05開始

#簽到表：
https://docs.google.com/spreadsheets/d/1gc16rrF-yZNs845z_nYrdgDIiSECOJok30dNLyQm69A/edit#gid=534323210

1. 題目說明。
2. 題目解析(BigO(n))。
4. 成員分享解題思路。
5. 問題與討論。

<!-- No.0 (請依序排序下去)
name: name (回報範例)
lighthouse: lighthouse
Replit：https://replit.com/@AllenLi23/AC-LeetCode-Js-219-Contains-Duplicate-II-Allen
-->

<!-- No.1
name: vanessa
lighthouse: [e-mail]
Replit：https://replit.com/@vanessalin3/AC-LeetCode-Js-219-Contains-Duplicate-II#index.js
-->

<!-- No.2
name: Jack Hung
lighthouse: [e-mail]
Replit：https://replit.com/@LungHsuanHung/AC-LeetCode-Go-219-Contains-Duplicate-II#main.go
-->

<!-- No.3
name: Winnie
lighthouse: [e-mail]
Replit：https://replit.com/@WinnieLin7/AC-LeetCode-Js-219-Contains-Duplicate-II#index.js
-->

<!-- No.4
name: Jerry
lighthouse: [e-mail]
Replit：https://replit.com/@Jerry-Chang975/AC-LeetCode-Js-219-Contains-Duplicate-II#index.js
-->

<!-- No.5
name: Kai
lighthouse: [e-mail]
Replit: https://replit.com/@Beginneraboutli/AC-LeetCode-Js-219-Contains-Duplicate-II#index.js
-->

<!-- No.6
name: 永c
lighthouse: [e-mail]
Replit: https://replit.com/@yongsin0129/AC-LeetCode-Js-219-Contains-Duplicate-II#index.js
-->

<!-- No.7
name: bun
lighthouse: [e-mail]
Replit: https://replit.com/@Shu-YinChen/AC-LeetCode-Js-219-Contains-Duplicate-II#index.js
-->