Merge pull request #29 from masx200/https/leetcode-cn.com/problems/sum-of-subsequence-widths

Https/leetcode cn.com/problems/sum of subsequence widths

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode-cn.com/problems/sum-of-subsequence-widths/
+
 https://leetcode.cn/problems/partition-equal-subset-sum/
 
 https://leetcode.cn/problems/NUPfPr/

sum-of-subsequence-widths/index.ts

@@ -0,0 +1,13 @@
+export default function sumSubseqWidths(nums: number[]): number {
+
+    const MOD = 1000000007;
+    nums.sort((a, b) => a - b);
+    let res = 0;
+    let x = nums[0], y = 2;
+    for (let j = 1; j < nums.length; j++) {
+        res = (res + nums[j] * (y - 1) - x) % MOD;
+        x = (x * 2 + nums[j]) % MOD;
+        y = y * 2 % MOD;
+    }
+    return (res + MOD) % MOD;
+}