97 低估了题目的难度，删除重写。

Author: aQua

Algorithms/0097.interleaving-string/README.md

@@ -0,0 +1,18 @@
+# [97. Interleaving String](https://leetcode.com/problems/interleaving-string/)
+
+## 题目
+Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
+```
+For example,
+Given:
+s1 = "aabcc",
+s2 = "dbbca",
+
+When s3 = "aadbbcbcac", return true.
+When s3 = "aadbbbaccc", return false.
+```
+
+## 解题思路
+s3 能否由 s1 和 s2，交替融合而生。
+
+见程序注释

Algorithms/0097.interleaving-string/interleaving-string.go

@@ -0,0 +1,30 @@
+package Problem0097
+
+func isInterleave(s1 string, s2 string, s3 string) bool {
+	m, n := len(s1), len(s2)
+	if m+n != len(s3) {
+		return false
+	}
+
+	dp := make([]bool, m+n+1)
+	dp[0] = true
+	i, j, k := 0, 0, 0
+	for i <= m && j <= n && k < m+n+1 {
+		switch {
+		case i < m && s1[i] == s3[k]:
+			dp[k] = true
+			i++
+			k++
+		case j < n && s2[j] == s3[k]:
+			dp[k] = true
+			j++
+			k++
+		default:
+			return false
+		}
+		if i == m && j == n {
+			return true
+		}
+	}
+	return false
+}

Algorithms/0097.interleaving-string/interleaving-string_test.go

@@ -0,0 +1,62 @@
+package Problem0097
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type question struct {
+	para
+	ans
+}
+
+// para 是参数
+type para struct {
+	s1 string
+	s2 string
+	s3 string
+}
+
+// ans 是答案
+type ans struct {
+	one bool
+}
+
+func Test_Problem0097(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+
+		question{
+			para{
+				"aabcc",
+				"dbbca",
+				"aadbbcbcac",
+			},
+			ans{
+				true,
+			},
+		},
+
+		question{
+			para{
+				"aabcc",
+				"dbbca",
+				"aadbbbaccc",
+			},
+			ans{
+				false,
+			},
+		},
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	for _, q := range qs {
+		a, p := q.ans, q.para
+		fmt.Printf("~~%v~~\n", p)
+
+		ast.Equal(a.one, isInterleave(p.s1, p.s2, p.s3), "输入:%v", p)
+	}
+}