891. Sum of Subsequence Widths

88 篇文章 0 订阅
30 篇文章 0 订阅

Given an array of integers A, consider all non-empty subsequences of A.

For any sequence S, let the width of S be the difference between the maximum and minimum element of S.

Return the sum of the widths of all subsequences of A. 

As the answer may be very large, return the answer modulo 10^9 + 7.

 

Example 1:

Input: [2,1,3]
Output: 6
Explanation:
Subsequences are [1], [2], [3], [2,1], [2,3], [1,3], [2,1,3].
The corresponding widths are 0, 0, 0, 1, 1, 2, 2.
The sum of these widths is 6.

 

Note:

  • 1 <= A.length <= 20000
  • 1 <= A[i] <= 20000

 

The order in initial arrays doesn't matter,
my first intuition is to sort the array.

 

For A[i]:
There are i smaller numbers,
so there are 2 ^ i sequences in which A[i] is maximum.
we should do res += A[i] * (2 ^ i)

 

There are n - i - 1 bigger numbers,
so there are 2 ^ (n - i - 1) sequences in which A[i] is minimum.
we should do res -= A[i] * 2 ^ (n - i - 1)

 

Done.

 

Time Complexity:
O(NlogN)

 

 

class Solution:
    def sumSubseqWidths(self, a):
        """
        :type A: List[int]
        :rtype: int
        """
        res=0
        a.sort()
        n=len(a)
        tmp=[1]*n
        for i in range(1,n): tmp[i]=tmp[i-1]*2
        for i in range(n):
            res+=a[i]*tmp[i]
            res-=a[i]*tmp[n-i-1]
        return res%(10**9 + 7)
    
s=Solution()
print(s.sumSubseqWidths([2,1,3]))

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值