feat: add typescript solution to lc problem: No.0279.Perfect Squares (doocs#451)

Author: zhaocchen

solution/0200-0299/0279.Perfect Squares/README.md

@@ -82,6 +82,22 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numSquares(n: number): number {
+    let dp = new Array(n + 1).fill(0);
+    for (let i = 1; i <= n; ++i) {
+        let min = Infinity;
+        for (let j = 1; j * j <= i; ++j) {
+            min = Math.min(min, dp[i - j * j]);
+        }
+        dp[i] = min + 1;
+    }
+    return dp.pop();
+};
+```
+
 ### **Go**
 
 ```go

solution/0200-0299/0279.Perfect Squares/README_EN.md

@@ -73,6 +73,22 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numSquares(n: number): number {
+    let dp = new Array(n + 1).fill(0);
+    for (let i = 1; i <= n; ++i) {
+        let min = Infinity;
+        for (let j = 1; j * j <= i; ++j) {
+            min = Math.min(min, dp[i - j * j]);
+        }
+        dp[i] = min + 1;
+    }
+    return dp.pop();
+};
+```
+
 ### **Go**
 
 ```go

solution/0200-0299/0279.Perfect Squares/Solution.ts

@@ -0,0 +1,11 @@
+function numSquares(n: number): number {
+    let dp = new Array(n + 1).fill(0);
+    for (let i = 1; i <= n; ++i) {
+        let min = Infinity;
+        for (let j = 1; j * j <= i; ++j) {
+            min = Math.min(min, dp[i - j * j]);
+        }
+        dp[i] = min + 1;
+    }
+    return dp.pop();
+};