From daed63abe9ecf485667651c15ab90d7f0c3eb49a Mon Sep 17 00:00:00 2001 From: oheunhyuck <71165142+oheunhyuck@users.noreply.github.com> Date: Mon, 9 Nov 2026 18:38:30 +0900 Subject: [PATCH] Create Code Testcase Testcase Test Result Test Result 2104. Sum of Subarray Ranges --- ... Test Result 2104. Sum of Subarray Ranges" | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 "leetcode3/\354\230\244\354\235\200\355\230\201/Code Testcase Testcase Test Result Test Result 2104. Sum of Subarray Ranges" diff --git "a/leetcode3/\354\230\244\354\235\200\355\230\201/Code Testcase Testcase Test Result Test Result 2104. Sum of Subarray Ranges" "b/leetcode3/\354\230\244\354\235\200\355\230\201/Code Testcase Testcase Test Result Test Result 2104. Sum of Subarray Ranges" new file mode 100644 index 00000000..1998005e --- /dev/null +++ "b/leetcode3/\354\230\244\354\235\200\355\230\201/Code Testcase Testcase Test Result Test Result 2104. Sum of Subarray Ranges" @@ -0,0 +1,32 @@ +class Solution: + def subArrayRanges(self, nums: List[int]) -> int: + n = len(nums) + answer = 0 + + left = [-1] * n + right = [n] * n + stack = [] + for i in range(n): + while stack and nums[stack[-1]] < nums[i]: + j = stack.pop() + right[j] = i + if stack: + left[i] = stack[-1] + stack.append(i) + for i in range(n): + answer += nums[i] * (i - left[i]) * (right[i] - i) + + left = [-1] * n + right = [n] * n + stack = [] + for i in range(n): + while stack and nums[stack[-1]] > nums[i]: + j = stack.pop() + right[j] = i + if stack: + left[i] = stack[-1] + stack.append(i) + for i in range(n): + answer -= nums[i] * (i - left[i]) * (right[i] - i) + + return answer