FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2436,3  "name": "make-array-zero-by-subtracting-equal-amounts",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/",6  "date": "2022-07-24",7  "task_description": "You are given a non-negative integer array `nums`. In one operation, you must: Choose a positive integer `x` such that `x` is less than or equal to the **smallest non-zero** element in `nums`. Subtract `x` from every **positive** element in `nums`. Return _the **minimum** number of operations to make every element in _`nums`_ equal to _`0`. **Example 1:** ``` **Input:** nums = [1,5,0,3,5] **Output:** 3 **Explanation:** In the first operation, choose x = 1. Now, nums = [0,4,0,2,4]. In the second operation, choose x = 2. Now, nums = [0,2,0,0,2]. In the third operation, choose x = 2. Now, nums = [0,0,0,0,0]. ``` **Example 2:** ``` **Input:** nums = [0] **Output:** 0 **Explanation:** Each element in nums is already 0 so no operations are needed. ``` **Constraints:** `1 <= nums.length <= 100` `0 <= nums[i] <= 100`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [1,5,0,3,5]",12      "output": "3 "13    },14    {15      "label": "Example 2",16      "input": "nums = [0]",17      "output": "0 "18    }19  ],20  "constraints": [21    "Choose a positive integer x such that x is less than or equal to the smallest non-zero element in nums.",22    "Subtract x from every positive element in nums.",23    "1 <= nums.length <= 100",24    "0 <= nums[i] <= 100"25  ],26  "python_template": "class Solution(object):\n    def minimumOperations(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"\n        ",27  "java_template": "class Solution {\n    public int minimumOperations(int[] nums) {\n        \n    }\n}",28  "metadata": {29    "func_name": "minimumOperations"30  }31}