feat: add typescript solution to lc problem: No.2260

No.2260.Minimum Consecutive Cards to Pick Up

Author: zhaocchen

solution/2200-2299/2260.Minimum Consecutive Cards to Pick Up/README.md

@@ -124,7 +124,20 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function minimumCardPickup(cards: number[]): number {
+    const n = cards.length;
+    let hashMap = new Map<number, number>();
+    const max = Number.MAX_SAFE_INTEGER;
+    let ans = max;
+    for (let i = 0; i < n; i++) {
+        let num = cards[i];
+        if (hashMap.has(num)) {
+            ans = Math.min(i - hashMap.get(num) + 1, ans);
+        }
+        hashMap.set(num, i);
+    }
+    return ans == max ? -1 : ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2260.Minimum Consecutive Cards to Pick Up/README_EN.md

@@ -118,7 +118,20 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function minimumCardPickup(cards: number[]): number {
+    const n = cards.length;
+    let hashMap = new Map<number, number>();
+    const max = Number.MAX_SAFE_INTEGER;
+    let ans = max;
+    for (let i = 0; i < n; i++) {
+        let num = cards[i];
+        if (hashMap.has(num)) {
+            ans = Math.min(i - hashMap.get(num) + 1, ans);
+        }
+        hashMap.set(num, i);
+    }
+    return ans == max ? -1 : ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2260.Minimum Consecutive Cards to Pick Up/Solution.ts

@@ -0,0 +1,14 @@
+function minimumCardPickup(cards: number[]): number {
+    const n = cards.length;
+    let hashMap = new Map<number, number>();
+    const max = Number.MAX_SAFE_INTEGER;
+    let ans = max;
+    for (let i = 0; i < n; i++) {
+        let num = cards[i];
+        if (hashMap.has(num)) {
+            ans = Math.min(i - hashMap.get(num) + 1, ans);
+        }
+        hashMap.set(num, i);
+    }
+    return ans == max ? -1 : ans;
+};