521 added

Author: aQua

Algorithms/0521.longest-uncommon-subsequence-i/README.md

@@ -0,0 +1,28 @@
+# [521. Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/)
+
+## 题目
+
+Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings.
+
+The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings.
+
+A subsequence is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements. Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.
+
+The input will be two strings, and the output needs to be the length of the longest uncommon subsequence. If the longest uncommon subsequence doesn't exist, return -1.
+
+Example 1:
+
+```text
+Input: "aba", "cdc"
+Output: 3
+Explanation: The longest uncommon subsequence is "aba" (or "cdc"), because "aba" is a subsequence of "aba", but not a subsequence of any other strings in the group of two strings.
+```
+
+Note:
+
+1. Both strings' lengths will not exceed 100.
+1. Only letters from a ~ z will appear in input strings.
+
+## 解题思路
+
+见程序注释

Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.go

@@ -0,0 +1,7 @@
+package Problem0521
+
+func findLUSlength(a string, b string) int {
+	res := 3
+
+	return res
+}

Algorithms/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i_test.go

@@ -0,0 +1,41 @@
+package Problem0521
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	a   string
+	b   string
+	ans int
+}{
+
+	{
+		"aba",
+		"cdc",
+		3,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_findLUSlength(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, findLUSlength(tc.a, tc.b), "输入:%v", tc)
+	}
+}
+
+func Benchmark_findLUSlength(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			findLUSlength(tc.a, tc.b)
+		}
+	}
+}