Example 1:
Input: nums = [1,0,1], queries = [[0,2,1]]
Output: true
Explanation:
Example 2:
Input: nums = [4,3,2,1], queries = [[1,3,2],[0,2,1]]
Output: false
Explanation:
Example 3:
Input: nums = [2,2], queries = [[0,1,1],[0,1,1]]
Output: true
Explanation:
You are given an integer array nums of length n and a 2D integer array queries, where queries[i] = [li, ri, vali].
For every index j such that li <= j <= ri, you may decrease nums[j] by any integer amount between 0 and vali (inclusive). The amount chosen at each index can differ.
Return true if it is possible to transform nums into a Zero Array (an array where every element is 0) after applying all queries; otherwise return false.
Each index in [0, 2] can be decremented by up to 1. Subtract 1 at indices 0 and 2 to get [0, 0, 0].
The total decrement budget at index 0 is 1, but nums[0] is 4, so it can never reach 0.
Each index has total capacity 2, matching nums[i].
1 <= nums.length <= 10^50 <= nums[i] <= 10^90 <= queries.length <= 10^5queries[i].length == 30 <= li <= ri < nums.length0 <= vali <= 10^4