From 80aa98a60258d8af2c436acbb842212296b51239 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 1 Sep 2021 12:42:39 +0800
Subject: [PATCH] =?UTF-8?q?219:=E5=AD=98=E5=9C=A8=E9=87=8D=E5=A4=8D?=
 =?UTF-8?q?=E5=85=83=E7=B4=A0=20II?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/ContainsDuplicateIi.java        | 50 +++++++++++++++++++
 .../cn/doc/content/ContainsDuplicateIi.md     | 19 +++++++
 2 files changed, 69 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/ContainsDuplicateIi.java
 create mode 100644 src/main/java/leetcode/editor/cn/doc/content/ContainsDuplicateIi.md

diff --git a/src/main/java/leetcode/editor/cn/ContainsDuplicateIi.java b/src/main/java/leetcode/editor/cn/ContainsDuplicateIi.java
new file mode 100644
index 0000000..991b0c8
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/ContainsDuplicateIi.java
@@ -0,0 +1,50 @@
+//给定一个整数数组和一个整数 k，判断数组中是否存在两个不同的索引 i 和 j，使得 nums [i] = nums [j]，并且 i 和 j 的差的 绝对值
+// 至多为 k。 
+//
+// 
+//
+// 示例 1: 
+//
+// 输入: nums = [1,2,3,1], k = 3
+//输出: true 
+//
+// 示例 2: 
+//
+// 输入: nums = [1,0,1,1], k = 1
+//输出: true 
+//
+// 示例 3: 
+//
+// 输入: nums = [1,2,3,1,2,3], k = 2
+//输出: false 
+// Related Topics 数组 哈希表 滑动窗口 👍 306 👎 0
+
+package leetcode.editor.cn;
+
+//219:存在重复元素 II
+class ContainsDuplicateIi {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new ContainsDuplicateIi().new Solution();
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public boolean containsNearbyDuplicate(int[] nums, int k) {
+            if (k <= 0) {
+                return false;
+            }
+            for (int i = 0; i < nums.length; i++) {
+                for (int j = i + 1; j <= Math.min(i + k, nums.length - 1); j++) {
+                    if (nums[i] == nums[j]) {
+                        return true;
+                    }
+                }
+            }
+            return false;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/ContainsDuplicateIi.md b/src/main/java/leetcode/editor/cn/doc/content/ContainsDuplicateIi.md
new file mode 100644
index 0000000..170f992
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/ContainsDuplicateIi.md
@@ -0,0 +1,19 @@
+<p>给定一个整数数组和一个整数&nbsp;<em>k</em>，判断数组中是否存在两个不同的索引<em>&nbsp;i</em>&nbsp;和<em>&nbsp;j</em>，使得&nbsp;<strong>nums [i] = nums [j]</strong>，并且 <em>i</em> 和 <em>j</em>&nbsp;的差的 <strong>绝对值</strong> 至多为 <em>k</em>。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例&nbsp;1:</strong></p>
+
+<pre><strong>输入:</strong> nums = [1,2,3,1], k<em> </em>= 3
+<strong>输出:</strong> true</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入: </strong>nums = [1,0,1,1], k<em> </em>=<em> </em>1
+<strong>输出:</strong> true</pre>
+
+<p><strong>示例 3:</strong></p>
+
+<pre><strong>输入: </strong>nums = [1,2,3,1,2,3], k<em> </em>=<em> </em>2
+<strong>输出:</strong> false</pre>
+<div><div>Related Topics</div><div><li>数组</li><li>哈希表</li><li>滑动窗口</li></div></div><br><div><li>👍 306</li><li>👎 0</li></div>
\ No newline at end of file