https://leetcode.cn/problems/minimum-absolute-difference-queries/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/minimum-absolute-difference-queries/
+
 https://leetcode.cn/problems/boolean-evaluation-lcci/
 
 https://leetcode.cn/problems/build-an-array-with-stack-operations/

image-overlap/index.ts

@@ -1,6 +1,6 @@
 export default function largestOverlap(
     img1: number[][],
-    img2: number[][]
+    img2: number[][],
 ): number {
     const len = img1.length;
     const count: number[][] = Array(2 * len + 1)

minimum-absolute-difference-queries/index.ts

@@ -0,0 +1,42 @@
+export default function minDifference(
+    nums: number[],
+    queries: number[][],
+): number[] {
+    const n = nums.length;
+
+    const presum = Array(100)
+        .fill(0)
+        .map(() => Array<number>(n).fill(0));
+
+    for (let k = 1; k <= 100; k++) {
+        for (let i = 0; i < n; i++) {
+            presum[k - 1][i] = (i == 0 ? 0 : presum[k - 1][i - 1]) +
+                Number(nums[i] == k);
+        }
+    }
+
+    return queries.map(([left, right]) => {
+        const arr = Array<number>();
+        for (let k = 1; k <= 100; k++) {
+            const count = presum[k - 1][right] -
+                (left == 0 ? 0 : presum[k - 1][left - 1]);
+
+            if (count) {
+                arr.push(k);
+            }
+
+            if (
+                arr.length >= 2 &&
+                arr[arr.length - 1] - arr[arr.length - 2] == 1
+            ) {
+                return 1;
+            }
+        }
+        if (arr.length <= 1) return -1;
+        else {
+            return Math.min(
+                ...arr.map((v, i, a) => (i === 0 ? Infinity : v - a[i - 1])),
+            );
+        }
+    });
+}