refactor 243

fishercoder1534 · fishercoder1534 · commit 3888a18f7c50 · 2020-05-23T08:18:23.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_243.java b/src/main/java/com/fishercoder/solutions/_243.java
@@ -1,18 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 243. Shortest Word Distance
- *
- * Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
-
- For example,
- Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
-
- Given word1 = “coding”, word2 = “practice”, return 3.
- Given word1 = "makes", word2 = "coding", return 1.
-
- Note:
- You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.*/
 public class _243 {
     public static class Solution1 {
         public int shortestDistance(String[] words, String word1, String word2) {
