feat: add typescript solution to lc problem: No.1906.Minimum Absolute Difference Queries (#471)

Author: zhaocchen

solution/1900-1999/1906.Minimum Absolute Difference Queries/README.md

@@ -141,6 +141,39 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minDifference(nums: number[], queries: number[][]): number[] {
+    let m = nums.length, n = queries.length;
+    let max = 100;
+    // let max = Math.max(...nums);
+    let pre: number[][] = [];
+    pre.push(new Array(max + 1).fill(0));
+    for (let i = 0; i < m; ++i) {
+        let num = nums[i];
+        pre.push(pre[i].slice());
+        pre[i + 1][num] += 1;
+    }
+
+    let ans = [];
+    for (let [left, right] of queries) {
+        let last = -1;
+        let min = Infinity;
+        for (let j = 1; j < max + 1; ++j) {
+            if (pre[left][j] < pre[right + 1][j]) {
+                if (last != -1) {
+                    min = Math.min(min, j - last);
+                }
+                last = j;
+            }
+        }
+        ans.push(min == Infinity ? -1 : min);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1900-1999/1906.Minimum Absolute Difference Queries/README_EN.md

@@ -129,6 +129,39 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minDifference(nums: number[], queries: number[][]): number[] {
+    let m = nums.length, n = queries.length;
+    let max = 100;
+    // let max = Math.max(...nums);
+    let pre: number[][] = [];
+    pre.push(new Array(max + 1).fill(0));
+    for (let i = 0; i < m; ++i) {
+        let num = nums[i];
+        pre.push(pre[i].slice());
+        pre[i + 1][num] += 1;
+    }
+
+    let ans = [];
+    for (let [left, right] of queries) {
+        let last = -1;
+        let min = Infinity;
+        for (let j = 1; j < max + 1; ++j) {
+            if (pre[left][j] < pre[right + 1][j]) {
+                if (last != -1) {
+                    min = Math.min(min, j - last);
+                }
+                last = j;
+            }
+        }
+        ans.push(min == Infinity ? -1 : min);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1900-1999/1906.Minimum Absolute Difference Queries/Solution.ts

@@ -0,0 +1,28 @@
+function minDifference(nums: number[], queries: number[][]): number[] {
+    let m = nums.length, n = queries.length;
+    let max = 100;
+    // let max = Math.max(...nums);
+    let pre: number[][] = [];
+    pre.push(new Array(max + 1).fill(0));
+    for (let i = 0; i < m; ++i) {
+        let num = nums[i];
+        pre.push(pre[i].slice());
+        pre[i + 1][num] += 1;
+    }
+
+    let ans = [];
+    for (let [left, right] of queries) {
+        let last = -1;
+        let min = Infinity;
+        for (let j = 1; j < max + 1; ++j) {
+            if (pre[left][j] < pre[right + 1][j]) {
+                if (last != -1) {
+                    min = Math.min(min, j - last);
+                }
+                last = j;
+            }
+        }
+        ans.push(min == Infinity ? -1 : min);
+    }
+    return ans;
+};