daily

Author: Zanger67

my-submissions/m1749 v2 one-ish-liner.py

@@ -0,0 +1,7 @@
+class Solution:
+    def maxAbsoluteSum(self, nums: List[int]) -> int:
+        # kadane's but for both min and max
+        output = abs(nums[0])
+        minn, maxx = nums[0], nums[0]
+
+        return max([(output := max(output, (maxx := max(maxx + num, num)), -(minn := min(minn + num, num)))) for num in nums[1:]] + [output])

my-submissions/m1749.py

@@ -0,0 +1,14 @@
+class Solution:
+    def maxAbsoluteSum(self, nums: List[int]) -> int:
+        # kadane's but for both min and max
+        output = abs(nums[0])
+
+        max_sub_arr = nums[0]
+        min_sub_arr = nums[0]
+
+        for num in nums[1:] :
+            max_sub_arr = max(max_sub_arr + num, num)
+            min_sub_arr = min(min_sub_arr + num, num)
+            output = max(output, max_sub_arr, -min_sub_arr)
+
+        return output