zoukankan      html  css  js  c++  java
  • 【leetcode】1403. Minimum Subsequence in Non-Increasing Order

    题目如下:

    Given the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subsequence. 

    If there are multiple solutions, return the subsequence with minimum size and if there still exist multiple solutions, return the subsequence with the maximum total sum of all its elements. A subsequence of an array can be obtained by erasing some (possibly zero) elements from the array. 

    Note that the solution with the given constraints is guaranteed to be unique. Also return the answer sorted in non-increasing order.

    Example 1:

    Input: nums = [4,3,10,9,8]
    Output: [10,9] 
    Explanation: The subsequences [10,9] and [10,8] are minimal such that the sum of their elements is strictly greater than 
    the sum of elements not included, however, the subsequence [10,9] has the maximum total sum of its elements. 

    Example 2:

    Input: nums = [4,4,7,6,7]
    Output: [7,7,6] 
    Explanation: The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of 
    elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions.
    Note the subsequence has to returned in non-decreasing order.

    Example 3:

    Input: nums = [6]
    Output: [6]

    Constraints:

    • 1 <= nums.length <= 500
    • 1 <= nums[i] <= 100

    解题思路:把nums按降序排序,从最大的优先选起,直到和超过总和的一半为止。

    代码如下:

    class Solution(object):
        def minSubsequence(self, nums):
            """
            :type nums: List[int]
            :rtype: List[int]
            """
            total = sum(nums)
            amount = 0
            res = []
            nums.sort(reverse=True)
            while len(nums) > 0:
                val = nums.pop(0)
                res.append(val)
                total -= val
                amount += val
                if amount > total:break
            return res
  • 相关阅读:
    solr一些错误
    maven聚合工程之找不到符号,类等错误
    图片服务器搭建及上传测试,网络配置问题(errno: 111)
    安装Nginx,make时报错:/usr/bin/ld: cannot find -lfdfsclient或者类似找不到-lxxx
    关于PCA算法的学习
    生物信息及开发常用的Linux命令
    05.课程主页面三个接口开发
    04.增加media文件配置
    3.课程相关5张表设计
    2.增加抽象基类
  • 原文地址:https://www.cnblogs.com/seyjs/p/12771504.html
Copyright © 2011-2022 走看看