edit 220

Author: fishercoder1534

README.md

@@ -361,7 +361,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |224|[Basic Calculator](https://leetcode.com/problems/basic-calculator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_224.java)| ?|? | Hard| 
 |223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_223.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
+|220|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_220.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/_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

…oder/solutions/ContainsDuplicateIII.java …java/com/fishercoder/solutions/_220.javasrc/main/java/com/fishercoder/solutions/ContainsDuplicateIII.java renamed to src/main/java/com/fishercoder/solutions/_220.java src/main/java/com/fishercoder/solutions/ContainsDuplicateIII.java renamed to src/main/java/com/fishercoder/solutions/_220.java

@@ -9,7 +9,7 @@
  * distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at
  * most t and the difference between i and j is at most k.
  */
-public class ContainsDuplicateIII {
+public class _220 {
     /**
      * TreeSet: per Java doc, is a NavigableSet implementation based on a TreeMap. The elements are ordered
      * using their natural ordering, or by a Comparator provided at set creation time, depending on
@@ -65,7 +65,7 @@ public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
      */
 
     public static void main(String... strings) {
-        ContainsDuplicateIII test = new ContainsDuplicateIII();
+        _220 test = new _220();
         // int[] nums = new int[]{-1, -1};
         // int k = 1;
         // int t = 0;