FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3643,3  "name": "zero-array-transformation-ii",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/zero-array-transformation-ii/",6  "date": "2024-11-10",7  "task_description": "You are given an integer array `nums` of length `n` and a 2D array `queries` where `queries[i] = [li, ri, vali]`. Each `queries[i]` represents the following action on `nums`: Decrement the value at each index in the range `[li, ri]` in `nums` by **at most** `vali`. The amount by which each value is decremented can be chosen **independently** for each index. A **Zero Array** is an array with all its elements equal to 0. Return the **minimum** possible **non-negative** value of `k`, such that after processing the first `k` queries in **sequence**, `nums` becomes a **Zero Array**. If no such `k` exists, return -1. **Example 1:** **Input:** nums = [2,0,2], queries = [[0,2,1],[0,2,1],[1,1,3]] **Output:** 2 **Explanation:** **For i = 0 (l = 0, r = 2, val = 1):** Decrement values at indices `[0, 1, 2]` by `[1, 0, 1]` respectively. The array will become `[1, 0, 1]`. **For i = 1 (l = 0, r = 2, val = 1):** Decrement values at indices `[0, 1, 2]` by `[1, 0, 1]` respectively. The array will become `[0, 0, 0]`, which is a Zero Array. Therefore, the minimum value of `k` is 2. **Example 2:** **Input:** nums = [4,3,2,1], queries = [[1,3,2],[0,2,1]] **Output:** -1 **Explanation:** **For i = 0 (l = 1, r = 3, val = 2):** Decrement values at indices `[1, 2, 3]` by `[2, 2, 1]` respectively. The array will become `[4, 1, 0, 0]`. **For i = 1 (l = 0, r = 2, val = 1):** Decrement values at indices `[0, 1, 2]` by `[1, 1, 0]` respectively. The array will become `[3, 0, 0, 0]`, which is not a Zero Array. **Constraints:** `1 <= nums.length <= 105` `0 <= nums[i] <= 5 * 105` `1 <= queries.length <= 105` `queries[i].length == 3` `0 <= li <= ri < nums.length` `1 <= vali <= 5`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [2,0,2], queries = [[0,2,1],[0,2,1],[1,1,3]]",12      "output": "2 "13    },14    {15      "label": "Example 2",16      "input": "nums = [4,3,2,1], queries = [[1,3,2],[0,2,1]]",17      "output": "-1 "18    }19  ],20  "constraints": [21    "Decrement the value at each index in the range [li, ri] in nums by at most vali.",22    "The amount by which each value is decremented can be chosen independently for each index.",23    "For i = 0 (l = 0, r = 2, val = 1):\n\nDecrement values at indices [0, 1, 2] by [1, 0, 1] respectively.\nThe array will become [1, 0, 1].",24    "Decrement values at indices [0, 1, 2] by [1, 0, 1] respectively.",25    "The array will become [1, 0, 1].",26    "For i = 1 (l = 0, r = 2, val = 1):\n\nDecrement values at indices [0, 1, 2] by [1, 0, 1] respectively.\nThe array will become [0, 0, 0], which is a Zero Array. Therefore, the minimum value of k is 2.",27    "Decrement values at indices [0, 1, 2] by [1, 0, 1] respectively.",28    "The array will become [0, 0, 0], which is a Zero Array. Therefore, the minimum value of k is 2.",29    "Decrement values at indices [0, 1, 2] by [1, 0, 1] respectively.",30    "The array will become [1, 0, 1].",31    "Decrement values at indices [0, 1, 2] by [1, 0, 1] respectively.",32    "The array will become [0, 0, 0], which is a Zero Array. Therefore, the minimum value of k is 2.",33    "For i = 0 (l = 1, r = 3, val = 2):\n\nDecrement values at indices [1, 2, 3] by [2, 2, 1] respectively.\nThe array will become [4, 1, 0, 0].",34    "Decrement values at indices [1, 2, 3] by [2, 2, 1] respectively.",35    "The array will become [4, 1, 0, 0].",36    "For i = 1 (l = 0, r = 2, val = 1):\n\nDecrement values at indices [0, 1, 2] by [1, 1, 0] respectively.\nThe array will become [3, 0, 0, 0], which is not a Zero Array.",37    "Decrement values at indices [0, 1, 2] by [1, 1, 0] respectively.",38    "The array will become [3, 0, 0, 0], which is not a Zero Array.",39    "Decrement values at indices [1, 2, 3] by [2, 2, 1] respectively.",40    "The array will become [4, 1, 0, 0].",41    "Decrement values at indices [0, 1, 2] by [1, 1, 0] respectively.",42    "The array will become [3, 0, 0, 0], which is not a Zero Array.",43    "1 <= nums.length <= 105",44    "0 <= nums[i] <= 5 * 105",45    "1 <= queries.length <= 105",46    "queries[i].length == 3",47    "0 <= li <= ri < nums.length",48    "1 <= vali <= 5"49  ],50  "python_template": "class Solution(object):\n    def minZeroArray(self, nums, queries):\n        \"\"\"\n        :type nums: List[int]\n        :type queries: List[List[int]]\n        :rtype: int\n        \"\"\"\n        ",51  "java_template": "class Solution {\n    public int minZeroArray(int[] nums, int[][] queries) {\n        \n    }\n}",52  "metadata": {53    "func_name": "minZeroArray"54  }55}