Files
LeetCode-Go/leetcode/0891.Sum-of-Subsequence-Widths/891. Sum of Subsequence Widths.go
2020-08-07 17:06:53 +08:00

16 lines
236 B
Go

package leetcode
import (
"sort"
)
func sumSubseqWidths(A []int) int {
sort.Ints(A)
res, mod, n, p := 0, 1000000007, len(A), 1
for i := 0; i < n; i++ {
res = (res + (A[i]-A[n-1-i])*p) % mod
p = (p << 1) % mod
}
return res
}