refactor 220

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_220.java

@@ -2,13 +2,6 @@
 
 import java.util.TreeSet;
 
-/**
- * 220. Contains Duplicate III
- *
- * Given an array of integers, find out whether there are two
- * 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 _220 {
 
     public static class Solution1 {