673 wrong answer

Author: aQua

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

@@ -1,7 +1,21 @@
 package Problem0673
 
-func findNumberOfLIS(nums []int) int {
-	res := 0
+func findNumberOfLIS(a []int) int {
+	size := len(a)
+	rec := make([]int, 0, size)
 
-	return res
+	for _, n := range a {
+		isUsed := false
+		for i := range rec {
+			if rec[i] < n {
+				rec[i] = n
+				isUsed = true
+			}
+		}
+		if !isUsed {
+			rec = append(rec, n)
+		}
+	}
+
+	return len(rec)
 }

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

@@ -18,6 +18,11 @@ var tcs = []struct {
 		2,
 	},
 
+	{
+		[]int{1, 2, 4, 3, 5, 4, 7, 2},
+		3,
+	},
+
 	{
 		[]int{2, 2, 2, 2, 2},
 		5,