feat: add the solution of Longest Continuous Increasing Subsequence(674) with Java.

Author: Mukyu

README.md

@@ -70,7 +70,7 @@
 | [665][665-question] | [Non-decreasing Array][665-tips]                             | [✅][665-java] | [✅][665-js] |                  |
 | [669][669-question] | [Trim a Binary Search Tree][669-tips]                        | [✅][669-java] | [✅][669-js] |                  |
 | [671][671-question] | [Second Minimum Node In a Binary Tree][671-tips]             | [✅][671-java] | [✅][671-js] |                  |
-| [674][674-question] | [Longest Continuous Increasing Subsequence][674-tips]        |                | [✅][674-js] |                  |
+| [674][674-question] | [Longest Continuous Increasing Subsequence][674-tips]        | [✅][674-java] | [✅][674-js] |                  |
 | [680][680-question] | [Valid Palindrome II][680-tips]                              |                | [✅][680-js] |                  |
 | [682][682-question] | [Baseball Game][682-tips]                                    |                | [✅][682-js] |                  |
 | [686][686-question] | [Repeated String Match][686-tips]                            |                | [✅][686-js] |                  |
@@ -463,6 +463,7 @@
 [665-java]: ./src/_665/Solution.java
 [669-java]: ./src/_669/Solution.java
 [671-java]: ./src/_671/Solution.java
+[674-java]: ./src/_674/Solution.java
 [728-java]: ./src/_728/Solution.java
 [771-java]: ./src/_771/Solution.java
 [804-java]: ./src/_804/Solution.java

src/_674/Solution.java

@@ -0,0 +1,28 @@
+package _674;
+
+class Solution {
+    public int findLengthOfLCIS(int[] nums) {
+        if (nums.length == 0) {
+            return 0;
+        }
+        int len = 1;
+        int maxLen = 1;
+        for (int i = 1; i < nums.length; i++) {
+            if (nums[i] > nums[i-1]) {
+                len++;
+                if (len > maxLen) {
+                    maxLen = len;
+                }
+            } else {
+                len = 1;
+            }
+        }
+        return maxLen;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.findLengthOfLCIS(new int[] {1, 3, 5, 4, 7}));
+        System.out.println(solution.findLengthOfLCIS(new int[] {2, 2, 2, 2}));
+    }
+}

tips/674/README.md

@@ -1,46 +1,61 @@
-[xxxx][title]
+[Longest Continuous Increasing Subsequence][title]
 
 ## Description
-// 抄题目
-
+Given an unsorted array of integers, find the length of longest `continuous` increasing subsequence (subarray).
 
 **Example:**
 
 ```
-// 抄Example
+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. 
 ```
 
-**Note:**
-// Note
+**Example 2:**
 
-**Tags:** // tags
+```
+Input: [2,2,2,2,2]
+Output: 1
+Explanation: The longest continuous increasing subsequence is [2], its length is 1. 
+```
 
+**Note:**
 
-## 思路 1
-// 贴一些关键代码,说一些解题思路
-// (同一种语言可以写多种思路，与某种语言思路相同的另一种语言的思路无须赘述，但可以把代码贴在后面) 
-```java
+Length of the array will not exceed 10,000.
 
-```
-```javascript
+**Tags:** [Array](https://leetcode.com/tag/array/)
 
-```
-
-## 思路 2
-// 贴一些关键代码,说一些解题思路
-```java
+## 思路
 
-```
+找出所给数组中的最长连续递增子数组的长度。
 
-## 思路 3
-// 贴一些关键代码,说一些解题思路
-```kotlin
+**Java:**
 
+```java
+public int findLengthOfLCIS(int[] nums) {
+    if (nums.length == 0) {
+        return 0;
+    }
+    int len = 1;
+    int maxLen = 1;
+    for (int i = 1; i < nums.length; i++) {
+        if (nums[i] > nums[i-1]) {
+            len++;
+            if (len > maxLen) {
+                maxLen = len;
+            }
+        } else {
+            len = 1;
+        }
+    }
+    return maxLen;
+}
 ```
 
 ## 结语
-   
+
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]
 
-[title]: https://leetcode.com/problems/xxxx
+[title]: https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/
 [ls]: https://github.com/SDE603/LeetCode-Solution