Team Ai
Datasetpublic

FPEvalRepoPublic/LeetCodeMetaData

sourceHugging Faceupdated 9mo agoView on Hugging Face
0likes399downloads
maximum-count-of-positive-integer-and-negative-integer.json36 linesDownload Raw Back to root
1{2  "id": 2614,3  "name": "maximum-count-of-positive-integer-and-negative-integer",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/",6  "date": "2023-01-01",7  "task_description": "Given an array `nums` sorted in **non-decreasing** order, return _the maximum between the number of positive integers and the number of negative integers._ In other words, if the number of positive integers in `nums` is `pos` and the number of negative integers is `neg`, then return the maximum of `pos` and `neg`. **Note** that `0` is neither positive nor negative. **Example 1:** ``` **Input:** nums = [-2,-1,-1,1,2,3] **Output:** 3 **Explanation:** There are 3 positive integers and 3 negative integers. The maximum count among them is 3. ``` **Example 2:** ``` **Input:** nums = [-3,-2,-1,0,0,1,2] **Output:** 3 **Explanation:** There are 2 positive integers and 3 negative integers. The maximum count among them is 3. ``` **Example 3:** ``` **Input:** nums = [5,20,66,1314] **Output:** 4 **Explanation:** There are 4 positive integers and 0 negative integers. The maximum count among them is 4. ``` **Constraints:** `1 <= nums.length <= 2000` `-2000 <= nums[i] <= 2000` `nums` is sorted in a **non-decreasing order**. **Follow up:** Can you solve the problem in `O(log(n))` time complexity?",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [-2,-1,-1,1,2,3]",12      "output": "3 "13    },14    {15      "label": "Example 2",16      "input": "nums = [-3,-2,-1,0,0,1,2]",17      "output": "3 "18    },19    {20      "label": "Example 3",21      "input": "nums = [5,20,66,1314]",22      "output": "4 "23    }24  ],25  "constraints": [26    "In other words, if the number of positive integers in nums is pos and the number of negative integers is neg, then return the maximum of pos and neg.",27    "1 <= nums.length <= 2000",28    "-2000 <= nums[i] <= 2000",29    "nums is sorted in a non-decreasing order."30  ],31  "python_template": "class Solution(object):\n    def maximumCount(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"\n        ",32  "java_template": "class Solution {\n    public int maximumCount(int[] nums) {\n        \n    }\n}",33  "metadata": {34    "func_name": "maximumCount"35  }36}