2909. Minimum Sum of Mountain Triplets II

# Time:  O(n)
# Space: O(n)

# prefix sum
class Solution(object):
    def minimumSum(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        INF = float("inf")

        right = [INF]*len(nums)
        curr = INF
        for i in reversed(xrange(len(nums))):
            right[i] = curr
            curr = min(curr, nums[i])
        result = curr = INF
        for i in xrange(len(nums)):
            if curr < nums[i] > right[i]:
                result = min(result, curr+nums[i]+right[i])
            curr = min(curr, nums[i])
        return result if result != INF else -1


# Time:  O(n)
# Space: O(n)
# prefix sum
class Solution2(object):
    def minimumSum(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        INF = float("inf")

        left = [INF]*len(nums)
        curr = INF
        for i in xrange(len(nums)):
            left[i] = curr
            curr = min(curr, nums[i])
        right = [INF]*len(nums)
        curr = INF
        for i in reversed(xrange(len(nums))):
            right[i] = curr
            curr = min(curr, nums[i])
        result = INF
        for i in xrange(len(nums)):
            if left[i] < nums[i] > right[i]:
                result = min(result, left[i]+nums[i]+right[i])
        return result if result != INF else -1

Solution from kamyu104/LeetCode-Solutions · MIT