edit 219

fishercoder1534 · fishercoder1534 · commit 8d019b68b157 · 2017-07-20T09:12:31.000-07:00
diff --git a/README.md b/README.md
@@ -356,7 +356,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RectangleArea.java)| O(1)|O(1) | Easy| 
 |222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_222.java)| O(?)|O(h) | Medium| Recursion
 |220|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ContainsDuplicateIII.java)| O(nlogn)|O(n) | Medium| TreeSet
-|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ContainsDuplicateII.java)| O(n)|O(n) | Easy| HashMap
+|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_219.java)| O(n)|O(n) | Easy| HashMap
 |218|[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_218.java)| O(n)|O(n) | Hard| TreeMap, Design
 |217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_217.java)| O(n)|O(n) | Easy| HashSet
 |216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_216.java)| O(k * C(n, k))|O(k) | Medium| Backtracking
diff --git a/src/main/java/com/fishercoder/solutions/_219.java b/src/main/java/com/fishercoder/solutions/_219.java
@@ -6,7 +6,8 @@
 /**219. Contains Duplicate II
  *
 Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.*/
-public class ContainsDuplicateII {
+public class _219 {
+
     //pretty straightforward, use a hashmap, key is the number itself, value is the last index that this value appeared in the array
     //we can keep updating the value as we move forward, since if the current index minus the last index cannot be smaller than k, then
     //the later indices won't even do either. So, we only need to keep one index in the value of the HashMap. Cheers!
