refactor 414

fishercoder1534 · fishercoder1534 · commit b4a04aaeac6d · 2020-07-09T06:21:00.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_414.java b/src/main/java/com/fishercoder/solutions/_414.java
@@ -1,31 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 414. Third Maximum Number
- *
- * Given a non-empty array of integers, return the third maximum number in this array.
- * If it does not exist, return the maximum number. The time complexity must be in O(n).
-
- Example 1:
- Input: [3, 2, 1]
-
- Output: 1
-
- Explanation: The third maximum is 1.
- Example 2:
- Input: [1, 2]
-
- Output: 2
-
- Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
- Example 3:
- Input: [2, 2, 3, 1]
-
- Output: 1
-
- Explanation: Note that the third maximum here means the third maximum distinct number.
- Both numbers with value 2 are both considered as second maximum.
- */
 public class _414 {
 
     public static class Solution1 {
