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 [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] is ascending if nums[k] < nums[k + 1] for all $l \le k < r$. A subarray of size $1$ is considered ascending.

Constraints:

• $1 \le$ nums.length $\le 100$

• $1 \le$ nums[i] $\le 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.