673 added

Author: aQua

Algorithms/0673.number-of-longest-increasing-subsequence/README.md

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

Algorithms/0673.number-of-longest-increasing-subsequence/number-of-longest-increasing-subsequence.go

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

Algorithms/0673.number-of-longest-increasing-subsequence/number-of-longest-increasing-subsequence_test.go

@@ -0,0 +1,44 @@
+package Problem0673
+
+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},
+		2,
+	},
+
+	{
+		[]int{2, 2, 2, 2, 2},
+		5,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_fn(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, findNumberOfLIS(tc.nums), "输入:%v", tc)
+	}
+}
+
+func Benchmark_fn(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			findNumberOfLIS(tc.nums)
+		}
+	}
+}