feat: add ts solution to lc problem: No.1447

No.1447.Simplified Fractions

Author: zhaocchen

solution/1400-1499/1447.Simplified Fractions/README.md

@@ -82,6 +82,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function simplifiedFractions(n: number): string[] {
+    let ans: Array<string> = [];
+    for (let j = 2; j <= n; j++) {
+        for (let i = 1; i < j; i++) {
+            if (gcd(i, j) == 1) {
+                ans.push(`${i}/${j}`);
+            } 
+        }
+    }
+    return ans;
+};
+
+function gcd(a: number, b: number): number {
+    return a == 0 ? b : gcd(b % a, a);
+}
+```
+
 ### **C++**
 
 ```cpp

solution/1400-1499/1447.Simplified Fractions/README_EN.md

@@ -90,6 +90,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function simplifiedFractions(n: number): string[] {
+    let ans: Array<string> = [];
+    for (let j = 2; j <= n; j++) {
+        for (let i = 1; i < j; i++) {
+            if (gcd(i, j) == 1) {
+                ans.push(`${i}/${j}`);
+            } 
+        }
+    }
+    return ans;
+};
+
+function gcd(a: number, b: number): number {
+    return a == 0 ? b : gcd(b % a, a);
+}
+```
+
 ### **C++**
 
 ```cpp

solution/1400-1499/1447.Simplified Fractions/Solution.ts

@@ -0,0 +1,15 @@
+function simplifiedFractions(n: number): string[] {
+    let ans: Array<string> = [];
+    for (let j = 2; j <= n; j++) {
+        for (let i = 1; i < j; i++) {
+            if (gcd(i, j) == 1) {
+                ans.push(`${i}/${j}`);
+            } 
+        }
+    }
+    return ans;
+};
+
+function gcd(a: number, b: number): number {
+    return a == 0 ? b : gcd(b % a, a);
+}