feat: add typescript solution to lc problem: No.2073 (#614)

No.2073.Time Needed to Buy Tickets

Author: zhaocchen

solution/2000-2099/2073.Time Needed to Buy Tickets/README.md

@@ -91,6 +91,34 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function timeRequiredToBuy(tickets: number[], k: number): number {
+    const n = tickets.length;
+    let target = tickets[k] - 1;
+    let ans = 0;
+    // round1
+    for (let i = 0; i < n; i++) {
+        let num = tickets[i];
+        if (num <= target) {
+            ans += num;
+            tickets[i] = 0;
+        } else {
+            ans += target;
+            tickets[i] -= target;
+        }
+    }
+
+    // round2
+    for (let i = 0; i <= k; i++) {
+        let num = tickets[i];
+        ans += (num > 0 ? 1: 0);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/2000-2099/2073.Time Needed to Buy Tickets/README_EN.md

@@ -82,6 +82,34 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function timeRequiredToBuy(tickets: number[], k: number): number {
+    const n = tickets.length;
+    let target = tickets[k] - 1;
+    let ans = 0;
+    // round1
+    for (let i = 0; i < n; i++) {
+        let num = tickets[i];
+        if (num <= target) {
+            ans += num;
+            tickets[i] = 0;
+        } else {
+            ans += target;
+            tickets[i] -= target;
+        }
+    }
+
+    // round2
+    for (let i = 0; i <= k; i++) {
+        let num = tickets[i];
+        ans += (num > 0 ? 1: 0);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/2000-2099/2073.Time Needed to Buy Tickets/Solution.ts

@@ -0,0 +1,23 @@
+function timeRequiredToBuy(tickets: number[], k: number): number {
+    const n = tickets.length;
+    let target = tickets[k] - 1;
+    let ans = 0;
+    // round1
+    for (let i = 0; i < n; i++) {
+        let num = tickets[i];
+        if (num <= target) {
+            ans += num;
+            tickets[i] = 0;
+        } else {
+            ans += target;
+            tickets[i] -= target;
+        }
+    }
+
+    // round2
+    for (let i = 0; i <= k; i++) {
+        let num = tickets[i];
+        ans += (num > 0 ? 1: 0);
+    }
+    return ans;
+};