You are given a 0-indexed integer array nums
. You can rearrange the elements of nums
to any order (including the given order).
Let prefix
be the array containing the prefix sums of nums
after rearranging it. In other words, prefix[i]
is the sum of the elements from 0
to i
in nums
after rearranging it. The score of nums
is the number of positive integers in the array prefix
.
Return the maximum score you can achieve.
Example 1:
Input: nums = [2,-1,0,1,-3,3,-3] Output: 6 Explanation: We can rearrange the array into nums = [2,3,1,-1,-3,0,-3]. prefix = [2,5,6,5,2,2,-1], so the score is 6. It can be shown that 6 is the maximum score we can obtain.
Example 2:
Input: nums = [-2,-3,0] Output: 0 Explanation: Any rearrangement of the array will result in a score of 0.
Constraints:
1 <= nums.length <= 105
-106 <= nums[i] <= 106
Solution: Greedy
Sort the numbers in descending order.
Time complexity: O(nlogn)
Space complexity: O(1)
C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
// Author: Huahua class Solution { public: int maxScore(vector<int>& nums) { sort(rbegin(nums), rend(nums)); int ans = 0; for (long i = 0, s = 0; i < nums.size(); ++i) { s += nums[i]; if (s <= 0) break; ++ans; } return ans; } }; |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment