feat: add solutions to lc problems: No.1096, 1616 (doocs#917)

* No.1096.Brace Expansion II
* No.1616.Split Two Strings to Make Palindrome

Author: thinkasany

solution/1000-1099/1096.Brace Expansion II/README.md

@@ -198,6 +198,32 @@ func braceExpansionII(expression string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function braceExpansionII(expression: string): string[] {
+    const dfs = (exp: string) => {
+        let j = exp.indexOf('}');
+        if (j === -1) {
+            s.add(exp);
+            return;
+        }
+        let i = j;
+        while (exp.charAt(i) !== '{') {
+            --i;
+        }
+        let a = exp.substring(0, i);
+        let c = exp.substring(j + 1);
+        for (const b of exp.substring(i + 1, j).split(',')) {
+            dfs(a + b + c);
+        }
+    };
+    const s: Set<string> = new Set();
+    dfs(expression);
+    return Array.from(s).sort();
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1096.Brace Expansion II/README_EN.md

@@ -177,6 +177,32 @@ func braceExpansionII(expression string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function braceExpansionII(expression: string): string[] {
+    const dfs = (exp: string) => {
+        let j = exp.indexOf('}');
+        if (j === -1) {
+            s.add(exp);
+            return;
+        }
+        let i = j;
+        while (exp.charAt(i) !== '{') {
+            --i;
+        }
+        let a = exp.substring(0, i);
+        let c = exp.substring(j + 1);
+        for (const b of exp.substring(i + 1, j).split(',')) {
+            dfs(a + b + c);
+        }
+    };
+    const s: Set<string> = new Set();
+    dfs(expression);
+    return Array.from(s).sort();
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1096.Brace Expansion II/Solution.ts

@@ -0,0 +1,21 @@
+function braceExpansionII(expression: string): string[] {
+    const dfs = (exp: string) => {
+        let j = exp.indexOf('}');
+        if (j === -1) {
+            s.add(exp);
+            return;
+        }
+        let i = j;
+        while (exp.charAt(i) !== '{') {
+            --i;
+        }
+        let a = exp.substring(0, i);
+        let c = exp.substring(j + 1);
+        for (const b of exp.substring(i + 1, j).split(',')) {
+            dfs(a + b + c);
+        }
+    };
+    const s: Set<string> = new Set();
+    dfs(expression);
+    return Array.from(s).sort();
+}

solution/1600-1699/1616.Split Two Strings to Make Palindrome/README.md

@@ -203,6 +203,32 @@ impl Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function checkPalindromeFormation(a: string, b: string): boolean {
+    const check1 = (a: string, b: string) => {
+        let i = 0;
+        let j = b.length - 1;
+        while (i < j && a.charAt(i) === b.charAt(j)) {
+            i++;
+            j--;
+        }
+        return i >= j || check2(a, i, j) || check2(b, i, j);
+    };
+
+    const check2 = (a: string, i: number, j: number) => {
+        while (i < j && a.charAt(i) === a.charAt(j)) {
+            i++;
+            j--;
+        }
+        return i >= j;
+    };
+    return check1(a, b) || check1(b, a);
+}
+
+```
+
 ### **...**
 
 ```

solution/1600-1699/1616.Split Two Strings to Make Palindrome/README_EN.md

@@ -186,6 +186,31 @@ impl Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function checkPalindromeFormation(a: string, b: string): boolean {
+    const check1 = (a: string, b: string) => {
+        let i = 0;
+        let j = b.length - 1;
+        while (i < j && a.charAt(i) === b.charAt(j)) {
+            i++;
+            j--;
+        }
+        return i >= j || check2(a, i, j) || check2(b, i, j);
+    };
+
+    const check2 = (a: string, i: number, j: number) => {
+        while (i < j && a.charAt(i) === a.charAt(j)) {
+            i++;
+            j--;
+        }
+        return i >= j;
+    };
+    return check1(a, b) || check1(b, a);
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1616.Split Two Strings to Make Palindrome/Solution.ts

@@ -0,0 +1,20 @@
+function checkPalindromeFormation(a: string, b: string): boolean {
+    const check1 = (a: string, b: string) => {
+        let i = 0;
+        let j = b.length - 1;
+        while (i < j && a.charAt(i) === b.charAt(j)) {
+            i++;
+            j--;
+        }
+        return i >= j || check2(a, i, j) || check2(b, i, j);
+    };
+
+    const check2 = (a: string, i: number, j: number) => {
+        while (i < j && a.charAt(i) === a.charAt(j)) {
+            i++;
+            j--;
+        }
+        return i >= j;
+    };
+    return check1(a, b) || check1(b, a);
+}