refactor 245

fishercoder1534 · fishercoder1534 · commit 47240cdb3781 · 2020-05-23T08:19:06.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_245.java b/src/main/java/com/fishercoder/solutions/_245.java
@@ -1,21 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 245. Shortest Word Distance III
- *
- * This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.
- * Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
- * word1 and word2 may be the same and they represent two individual words in the list.
-
- For example,
- Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
-
- Given word1 = “makes”, word2 = “coding”, return 1.
- Given word1 = "makes", word2 = "makes", return 3.
-
- Note:
- You may assume word1 and word2 are both in the list.
- */
 public class _245 {
 
     public static class Solution1 {
