674 added

Author: aQua

Algorithms/0674.longest-continuous-increasing-subsequence/README.md

@@ -0,0 +1,28 @@
+# [674. Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)
+
+## 题目
+
+Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
+
+Example 1:
+
+```text
+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:
+
+```text
+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.
+
+## 解题思路
+
+见程序注释

Algorithms/0674.longest-continuous-increasing-subsequence/longest-continuous-increasing-subsequence.go

@@ -0,0 +1,7 @@
+package Problem0674
+
+func findLengthOfLCIS(nums []int) int {
+	res := 0
+
+	return res
+}

Algorithms/0674.longest-continuous-increasing-subsequence/longest-continuous-increasing-subsequence_test.go

@@ -0,0 +1,44 @@
+package Problem0674
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	nums []int
+	ans  int
+}{
+
+	{
+		[]int{1, 3, 5, 4, 7},
+		3,
+	},
+
+	{
+		[]int{2, 2, 2, 2, 2},
+		1,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_fn(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, findLengthOfLCIS(tc.nums), "输入:%v", tc)
+	}
+}
+
+func Benchmark_fn(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			findLengthOfLCIS(tc.nums)
+		}
+	}
+}