refactor 673

fishercoder1534 · fishercoder1534 · commit 085e89476643 · 2020-07-18T07:12:51.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_673.java b/src/main/java/com/fishercoder/solutions/_673.java
@@ -1,24 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 673. Number of Longest Increasing Subsequence
- * Given an unsorted array of integers, find the number of longest increasing subsequence.
-
- Example 1:
-
- Input: [1,3,5,4,7]
- Output: 2
- Explanation: The two longest increasing subsequence are [1, 3, 4, 7] and [1, 3, 5, 7].
-
- Example 2:
-
- Input: [2,2,2,2,2]
- Output: 5
- Explanation: The length of longest continuous increasing subsequence is 1,
- and there are 5 subsequences' length is 1, so output 5.
-
- Note: Length of the given array will be not exceed 2000 and the answer is guaranteed to be fit in 32-bit signed int.
- */
 public class _673 {
     public static class Solution1 {
         /**
