feat: add ts solution to lc problem: No.60 (#2801)

Author: cblh

solution/0000-0099/0060.Permutation Sequence/README.md

@@ -225,6 +225,31 @@ public class Solution {
 }
 ```
 
+```ts
+function getPermutation(n: number, k: number): string {
+    let ans = '';
+    const vis = Array.from({ length: n + 1 }, () => false);
+    for (let i = 0; i < n; i++) {
+        let fact = 1;
+        for (let j = 1; j < n - i; j++) {
+            fact *= j;
+        }
+        for (let j = 1; j <= n; j++) {
+            if (!vis[j]) {
+                if (k > fact) {
+                    k -= fact;
+                } else {
+                    ans += j;
+                    vis[j] = true;
+                    break;
+                }
+            }
+        }
+    }
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/0000-0099/0060.Permutation Sequence/README_EN.md

@@ -210,6 +210,31 @@ public class Solution {
 }
 ```
 
+```ts
+function getPermutation(n: number, k: number): string {
+    let ans = '';
+    const vis = Array.from({ length: n + 1 }, () => false);
+    for (let i = 0; i < n; i++) {
+        let fact = 1;
+        for (let j = 1; j < n - i; j++) {
+            fact *= j;
+        }
+        for (let j = 1; j <= n; j++) {
+            if (!vis[j]) {
+                if (k > fact) {
+                    k -= fact;
+                } else {
+                    ans += j;
+                    vis[j] = true;
+                    break;
+                }
+            }
+        }
+    }
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

solution/0000-0099/0060.Permutation Sequence/Solution.ts

@@ -0,0 +1,22 @@
+function getPermutation(n: number, k: number): string {
+    let ans = '';
+    const vis = Array.from({ length: n + 1 }, () => false);
+    for (let i = 0; i < n; i++) {
+        let fact = 1;
+        for (let j = 1; j < n - i; j++) {
+            fact *= j;
+        }
+        for (let j = 1; j <= n; j++) {
+            if (!vis[j]) {
+                if (k > fact) {
+                    k -= fact;
+                } else {
+                    ans += j;
+                    vis[j] = true;
+                    break;
+                }
+            }
+        }
+    }
+    return ans;
+}