feat: update solutions to lc problem: No.1646 (#931)

Author: thinkasany

solution/1600-1699/1646.Get Maximum in Generated Array/README.md

@@ -162,6 +162,23 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function getMaximumGenerated(n: number): number {
+    if (n === 0) {
+        return 0;
+    }
+    const nums: number[] = new Array(n + 1).fill(0);
+    nums[1] = 1;
+    for (let i = 2; i < n + 1; ++i) {
+        nums[i] =
+            i % 2 === 0 ? nums[i >> 1] : nums[i >> 1] + nums[(i >> 1) + 1];
+    }
+    return Math.max(...nums);
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1646.Get Maximum in Generated Array/README_EN.md

@@ -140,6 +140,23 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function getMaximumGenerated(n: number): number {
+    if (n === 0) {
+        return 0;
+    }
+    const nums: number[] = new Array(n + 1).fill(0);
+    nums[1] = 1;
+    for (let i = 2; i < n + 1; ++i) {
+        nums[i] =
+            i % 2 === 0 ? nums[i >> 1] : nums[i >> 1] + nums[(i >> 1) + 1];
+    }
+    return Math.max(...nums);
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1646.Get Maximum in Generated Array/Solution.ts

@@ -0,0 +1,12 @@
+function getMaximumGenerated(n: number): number {
+    if (n === 0) {
+        return 0;
+    }
+    const nums: number[] = new Array(n + 1).fill(0);
+    nums[1] = 1;
+    for (let i = 2; i < n + 1; ++i) {
+        nums[i] =
+            i % 2 === 0 ? nums[i >> 1] : nums[i >> 1] + nums[(i >> 1) + 1];
+    }
+    return Math.max(...nums);
+}