leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1749.cpp (614B)

0 class Solution { 1 public: 2 int maxAbsoluteSum(const vector<int> &nums) const { 3 int mini = 0, maxi = 0, res = 0; 4 for (const int n : nums) { 5 maxi = max(0, maxi + n); 6 mini = min(0, mini + n); 7 res = max({res, maxi, -mini}); 8 } 9 return res; 10 } 11 }; 12 13 class Solution { 14 public: 15 int maxAbsoluteSum(const vector<int> &nums) const { 16 int mini = 0, maxi = 0, sum = 0; 17 for (const int n : nums) { 18 sum += n; 19 mini = min(mini, sum); 20 maxi = max(maxi, sum); 21 } 22 return maxi - mini; 23 } 24 };