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

No.2251.Number of Flowers in Full Bloom

Author: zhaocchen

Diff for: solution/2200-2299/2251.Number of Flowers in Full Bloom/README.md

@@ -48,6 +48,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+离散差分+离散查询
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -69,7 +71,29 @@
 ### **TypeScript**
 
 ```ts
-
+function fullBloomFlowers(flowers: number[][], persons: number[]): number[] {
+    // 离散差分
+    let hashMap = new Map();
+    for (let [start, end] of flowers) {
+        end++;
+        hashMap.set(start, (hashMap.get(start) || 0) + 1);
+        hashMap.set(end, (hashMap.get(end) || 0) - 1);
+    }
+    for (let p of persons) {
+        if (!hashMap.has(p)) {
+            hashMap.set(p, 0);
+        }
+    }
+    let keys = Array.from(hashMap.keys()).sort((a, b) => a - b);
+    let pre = 0;
+    for (let k of keys) {
+        pre += hashMap.get(k);
+        hashMap.set(k, pre);
+    }
+    // 离散查询
+    let ans = persons.map(v => hashMap.get(v));
+    return ans;
+};
 ```
 
 ### **...**

Diff for: solution/2200-2299/2251.Number of Flowers in Full Bloom/README_EN.md

@@ -58,7 +58,27 @@ For each person, we return the number of flowers in full bloom during their arri
 ### **TypeScript**
 
 ```ts
-
+function fullBloomFlowers(flowers: number[][], persons: number[]): number[] {
+    let hashMap = new Map();
+    for (let [start, end] of flowers) {
+        end++;
+        hashMap.set(start, (hashMap.get(start) || 0) + 1);
+        hashMap.set(end, (hashMap.get(end) || 0) - 1);
+    }
+    for (let p of persons) {
+        if (!hashMap.has(p)) {
+            hashMap.set(p, 0);
+        }
+    }
+    let keys = Array.from(hashMap.keys()).sort((a, b) => a - b);
+    let pre = 0;
+    for (let k of keys) {
+        pre += hashMap.get(k);
+        hashMap.set(k, pre);
+    }
+    let ans = persons.map(v => hashMap.get(v));
+    return ans;
+};
 ```
 
 ### **...**

Diff for: solution/2200-2299/2251.Number of Flowers in Full Bloom/Solution.ts

@@ -0,0 +1,23 @@
+function fullBloomFlowers(flowers: number[][], persons: number[]): number[] {
+    // 离散差分
+    let hashMap = new Map();
+    for (let [start, end] of flowers) {
+        end++;
+        hashMap.set(start, (hashMap.get(start) || 0) + 1);
+        hashMap.set(end, (hashMap.get(end) || 0) - 1);
+    }
+    for (let p of persons) {
+        if (!hashMap.has(p)) {
+            hashMap.set(p, 0);
+        }
+    }
+    let keys = Array.from(hashMap.keys()).sort((a, b) => a - b);
+    let pre = 0;
+    for (let k of keys) {
+        pre += hashMap.get(k);
+        hashMap.set(k, pre);
+    }
+    // 离散查询
+    let ans = persons.map(v => hashMap.get(v));
+    return ans;
+};