Create 0918-maximum-sum-circular-subarray.py

Author: neetcode-gh

Diff for: python/0918-maximum-sum-circular-subarray.py

@@ -0,0 +1,14 @@
+class Solution:
+    def maxSubarraySumCircular(self, nums: List[int]) -> int:
+        globMax, globMin = nums[0], nums[0]
+        curMax, curMin = 0, 0
+        total = 0
+        
+        for i, n in enumerate(nums):
+            curMax = max(curMax + n, n)
+            curMin = min(curMin + n, n)
+            total += n
+            globMax = max(curMax, globMax)
+            globMin = min(curMin, globMin)
+
+        return max(globMax, total - globMin) if globMax > 0 else globMax