1800-MaximumAscendingSubarraySum.go

package main

// 1800. Maximum Ascending Subarray Sum
// Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums.

// A subarray is defined as a contiguous sequence of numbers in an array.

// A subarray [numsl, numsl+1, ..., numsr-1, numsr] is ascending if for all i where l <= i < r, numsi < numsi+1. 
// Note that a subarray of size 1 is ascending.

// Example 1:
// Input: nums = [10,20,30,5,10,50]
// Output: 65
// Explanation: [5,10,50] is the ascending subarray with the maximum sum of 65.

// Example 2:
// Input: nums = [10,20,30,40,50]
// Output: 150
// Explanation: [10,20,30,40,50] is the ascending subarray with the maximum sum of 150.

// Example 3:
// Input: nums = [12,17,15,13,10,11,12]
// Output: 33
// Explanation: [10,11,12] is the ascending subarray with the maximum sum of 33.

// Constraints:
//     1 <= nums.length <= 100
//     1 <= nums[i] <= 100

import "fmt"

func maxAscendingSum(nums []int) int {
    res, sum := nums[0], nums[0]
    max := func (x, y int) int { if x > y { return x; }; return y; }
    for i := 1; i < len(nums); i++ {
        if nums[i] > nums[i - 1] {
            sum += nums[i]
            res = max(res, sum)
        } else {
            sum = nums[i]
        }
    }
    return res
}

func main() {
    // Example 1:
    // Input: nums = [10,20,30,5,10,50]
    // Output: 65
    // Explanation: [5,10,50] is the ascending subarray with the maximum sum of 65.
    fmt.Println(maxAscendingSum([]int{10,20,30,5,10,50})) // 65
    // Example 2:
    // Input: nums = [10,20,30,40,50]
    // Output: 150
    // Explanation: [10,20,30,40,50] is the ascending subarray with the maximum sum of 150.
    fmt.Println(maxAscendingSum([]int{10,20,30,40,50})) // 150
    // Example 3:
    // Input: nums = [12,17,15,13,10,11,12]
    // Output: 33
    // Explanation: [10,11,12] is the ascending subarray with the maximum sum of 33.
    fmt.Println(maxAscendingSum([]int{12,17,15,13,10,11,12})) // 33
}