Maximum Sum Increasing Subsequence

Given an integer array nums, return the maximum sum of an increasing subsequence. An increasing subsequence is a sequence where elements are in increasing order.

Examples
Input: [1,2,4,3]
Output: 7
Hints

Maximum Sum Increasing Subsequence

Given an integer array `nums`, return the maximum sum of an increasing subsequence. An increasing subsequence is a sequence where elements are in increasing order.