feat: add solutions to lc problem: No.0674.Longest Continuous Increasing Subsequence

yanglbme · yanglbme · commit 0280ee0dd4ec · 2021-10-04T16:24:51.000+08:00
diff --git a/solution/0600-0699/0673.Number of Longest Increasing Subsequence/README.md b/solution/0600-0699/0673.Number of Longest Increasing Subsequence/README.md
@@ -26,7 +26,6 @@
 
 <p><strong>注意:</strong>&nbsp;给定的数组长度不超过 2000 并且结果一定是32位有符号整数。</p>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
diff --git a/solution/0600-0699/0673.Number of Longest Increasing Subsequence/README_EN.md b/solution/0600-0699/0673.Number of Longest Increasing Subsequence/README_EN.md
@@ -34,7 +34,6 @@
 	<li><code>-10<sup>6</sup> &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
 </ul>
 
-
 ## Solutions
 
 similar problem: [LIS](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md)
diff --git a/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README.md b/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README.md
@@ -38,7 +38,6 @@
 	<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -55,12 +54,24 @@
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
+```python
+class Solution:
+    def findLengthOfLCIS(self, nums: List[int]) -> int:
+        res, n = 1, len(nums)
+        i = 0
+        while i < n:
+            j = i + 1
+            while j < n and nums[j] > nums[j - 1]:
+                j += 1
+            res = max(res, j - i)
+            i = j
+        return res
+```
+
 ```python
 class Solution:
     def findLengthOfLCIS(self, nums: List[int]) -> int:
         n = len(nums)
-        if n < 2:
-            return n
         res = f = 1
         for i in range(1, n):
             f = 1 + (f if nums[i - 1] < nums[i] else 0)
@@ -75,10 +86,8 @@ class Solution:
 ```java
 class Solution {
     public int findLengthOfLCIS(int[] nums) {
-        int n;
-        if ((n = nums.length) < 2) return n;
-        int res = 1, f = 1;
-        for (int i = 1; i < n; ++i) {
+        int res = 1;
+        for (int i = 1, f = 1; i < nums.length; ++i) {
             f = 1 + (nums[i - 1] < nums[i] ? f : 0);
             res = Math.max(res, f);
         }
@@ -87,6 +96,66 @@ class Solution {
 }
 ```
 
+双指针：
+
+```java
+class Solution {
+    public int findLengthOfLCIS(int[] nums) {
+        int res = 1;
+        for (int i = 0, n = nums.length; i < n;) {
+            int j = i + 1;
+            while (j < n && nums[j] > nums[j - 1]) {
+                ++j;
+            }
+            res = Math.max(res, j - i);
+            i = j;
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findLengthOfLCIS(vector<int>& nums) {
+        int res = 1;
+        for (int i = 1, f = 1; i < nums.size(); ++i)
+        {
+            f = 1 + (nums[i - 1] < nums[i] ? f : 0);
+            res = max(res, f);
+        }
+        return res;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findLengthOfLCIS(nums []int) int {
+	res, f := 1, 1
+	for i := 1; i < len(nums); i++ {
+		if nums[i-1] < nums[i] {
+			f += 1
+			res = max(res, f)
+		} else {
+			f = 1
+		}
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README_EN.md b/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README_EN.md
@@ -36,19 +36,30 @@ increasing.
 	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
+```python
+class Solution:
+    def findLengthOfLCIS(self, nums: List[int]) -> int:
+        res, n = 1, len(nums)
+        i = 0
+        while i < n:
+            j = i + 1
+            while j < n and nums[j] > nums[j - 1]:
+                j += 1
+            res = max(res, j - i)
+            i = j
+        return res
+```
+
 ```python
 class Solution:
     def findLengthOfLCIS(self, nums: List[int]) -> int:
         n = len(nums)
-        if n < 2:
-            return n
         res = f = 1
         for i in range(1, n):
             f = 1 + (f if nums[i - 1] < nums[i] else 0)
@@ -61,10 +72,8 @@ class Solution:
 ```java
 class Solution {
     public int findLengthOfLCIS(int[] nums) {
-        int n;
-        if ((n = nums.length) < 2) return n;
-        int res = 1, f = 1;
-        for (int i = 1; i < n; ++i) {
+        int res = 1;
+        for (int i = 1, f = 1; i < nums.length; ++i) {
             f = 1 + (nums[i - 1] < nums[i] ? f : 0);
             res = Math.max(res, f);
         }
@@ -73,6 +82,64 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public int findLengthOfLCIS(int[] nums) {
+        int res = 1;
+        for (int i = 0, n = nums.length; i < n;) {
+            int j = i + 1;
+            while (j < n && nums[j] > nums[j - 1]) {
+                ++j;
+            }
+            res = Math.max(res, j - i);
+            i = j;
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findLengthOfLCIS(vector<int>& nums) {
+        int res = 1;
+        for (int i = 1, f = 1; i < nums.size(); ++i)
+        {
+            f = 1 + (nums[i - 1] < nums[i] ? f : 0);
+            res = max(res, f);
+        }
+        return res;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findLengthOfLCIS(nums []int) int {
+	res, f := 1, 1
+	for i := 1; i < len(nums); i++ {
+		if nums[i-1] < nums[i] {
+			f += 1
+			res = max(res, f)
+		} else {
+			f = 1
+		}
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.cpp b/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.cpp
@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int findLengthOfLCIS(vector<int>& nums) {
+        int res = 1;
+        for (int i = 1, f = 1; i < nums.size(); ++i)
+        {
+            f = 1 + (nums[i - 1] < nums[i] ? f : 0);
+            res = max(res, f);
+        }
+        return res;
+    }
+};
diff --git a/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.go b/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.go
@@ -0,0 +1,19 @@
+func findLengthOfLCIS(nums []int) int {
+	res, f := 1, 1
+	for i := 1; i < len(nums); i++ {
+		if nums[i-1] < nums[i] {
+			f += 1
+			res = max(res, f)
+		} else {
+			f = 1
+		}
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
diff --git a/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.java b/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.java
@@ -1,9 +1,7 @@
 class Solution {
     public int findLengthOfLCIS(int[] nums) {
-        int n;
-        if ((n = nums.length) < 2) return n;
-        int res = 1, f = 1;
-        for (int i = 1; i < n; ++i) {
+        int res = 1;
+        for (int i = 1, f = 1; i < nums.length; ++i) {
             f = 1 + (nums[i - 1] < nums[i] ? f : 0);
             res = Math.max(res, f);
         }
diff --git a/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.py b/solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.py
@@ -1,8 +1,6 @@
 class Solution:
     def findLengthOfLCIS(self, nums: List[int]) -> int:
         n = len(nums)
-        if n < 2:
-            return n
         res = f = 1
         for i in range(1, n):
             f = 1 + (f if nums[i - 1] < nums[i] else 0)
