refactor 594

fishercoder1534 · fishercoder1534 · commit 00cb435213fb · 2020-07-17T07:06:32.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_594.java b/src/main/java/com/fishercoder/solutions/_594.java
@@ -3,21 +3,6 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**
- * 594. Longest Harmonious Subsequence
- *
- * We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.
-
- Now, given an integer array, you need to find the length of its longest harmonious subsequence among all its possible subsequences.
-
- Example 1:
- Input: [1,3,2,2,5,2,3,7]
- Output: 5
-
- Explanation: The longest harmonious subsequence is [3,2,2,2,3].
- Note: The length of the input array will not exceed 20,000.
-
- */
 public class _594 {
     public static class Solution1 {
         public int findLHS(int[] nums) {
