feat: add solutions to lc problem: No.1027

Author: thinkasany

solution/1000-1099/1027.Longest Arithmetic Subsequence/README.md

@@ -154,6 +154,26 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function longestArithSeqLength(nums: number[]): number {
+    const n = nums.length;
+    let ans = 0;
+    const f: number[][] = Array.from({ length: n }, () =>
+        new Array(1001).fill(0),
+    );
+    for (let i = 1; i < n; ++i) {
+        for (let k = 0; k < i; ++k) {
+            const j = nums[i] - nums[k] + 500;
+            f[i][j] = Math.max(f[i][j], f[k][j] + 1);
+            ans = Math.max(ans, f[i][j]);
+        }
+    }
+    return ans + 1;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1027.Longest Arithmetic Subsequence/README_EN.md

@@ -136,6 +136,26 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function longestArithSeqLength(nums: number[]): number {
+    const n = nums.length;
+    let ans = 0;
+    const f: number[][] = Array.from({ length: n }, () =>
+        new Array(1001).fill(0),
+    );
+    for (let i = 1; i < n; ++i) {
+        for (let k = 0; k < i; ++k) {
+            const j = nums[i] - nums[k] + 500;
+            f[i][j] = Math.max(f[i][j], f[k][j] + 1);
+            ans = Math.max(ans, f[i][j]);
+        }
+    }
+    return ans + 1;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1027.Longest Arithmetic Subsequence/Solution.ts

@@ -0,0 +1,15 @@
+function longestArithSeqLength(nums: number[]): number {
+    const n = nums.length;
+    let ans = 0;
+    const f: number[][] = Array.from({ length: n }, () =>
+        new Array(1001).fill(0),
+    );
+    for (let i = 1; i < n; ++i) {
+        for (let k = 0; k < i; ++k) {
+            const j = nums[i] - nums[k] + 500;
+            f[i][j] = Math.max(f[i][j], f[k][j] + 1);
+            ans = Math.max(ans, f[i][j]);
+        }
+    }
+    return ans + 1;
+}