refactor 674

fishercoder1534 · fishercoder1534 · commit d97086dd31b6 · 2020-07-18T07:13:06.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_674.java b/src/main/java/com/fishercoder/solutions/_674.java
@@ -1,23 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 674. Longest Continuous Increasing Subsequence
- * Given an unsorted array of integers, find the length of longest continuous increasing subsequence.
-
- Example 1:
- Input: [1,3,5,4,7]
- Output: 3
- Explanation: The longest continuous increasing subsequence is [1,3,5],
- its length is 3. Even though [1,3,5,7] is also an increasing subsequence,
- it's not a continuous one where 5 and 7 are separated by 4.
-
- Example 2:
- Input: [2,2,2,2,2]
- Output: 1
- Explanation: The longest continuous increasing subsequence is [2], its length is 1.
-
- Note: Length of the array will not exceed 10,000.
- */
 public class _674 {
     public static class Solution1 {
         public int findLengthOfLCIS(int[] nums) {
