Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions leetcode3/송주혜/2104. Sum of Subarray Ranges
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
class Solution:
def subArrayRanges(self, nums: list[int]) -> int:
result = 0
n = len(nums)

for i in range(n):

# 각각의 최댓값 부분배열 개수
l = i
while l > 0 and nums[l - 1] < nums[i]:
l -= 1

r = i
while r < n-1 and nums[r+1] <= nums[i]:
r +=1

result += nums[i] * (i-l+1)*(r-i+1)

# 각각의 최솟값 부분배열 개수
l = i
while l > 0 and nums[l - 1] > nums[i]:
l -= 1

r = i
while r < n-1 and nums[r+1] >= nums[i]:
r +=1

result -= nums[i] * (i-l+1)*(r-i+1)

return result
Loading