LeetCode 891. Sum of Subsequence Widths (找规律)

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 wid

>>阅读原文<<