Package g1501_1600.s1537_get_the_maximum_score

Class Solution

java.lang.Object
g1501_1600.s1537_get_the_maximum_score.Solution
public class Solution extends Object
1537 - Get the Maximum Score\. Hard You are given two **sorted** arrays of distinct integers `nums1` and `nums2.` A **valid path** is defined as follows: * Choose array `nums1` or `nums2` to traverse (from index-0). * Traverse the current array from left to right. * If you are reading any value that is present in `nums1` and `nums2` you are allowed to change your path to the other array. (Only one repeated value is considered in the valid path). The **score** is defined as the sum of uniques values in a valid path. Return _the maximum score you can obtain of all possible **valid paths**_. Since the answer may be too large, return it modulo 109 + 7. **Example 1:** ![](https://assets.leetcode.com/uploads/2020/07/16/sample_1_1893.png) **Input:** nums1 = [2,4,5,8,10], nums2 = [4,6,8,9] **Output:** 30 **Explanation:** Valid paths: [2,4,5,8,10], [2,4,5,8,9], [2,4,6,8,9], [2,4,6,8,10], (starting from nums1) [4,6,8,9], [4,5,8,10], [4,5,8,9], [4,6,8,10] (starting from nums2) The maximum is obtained with the path in green **[2,4,6,8,10]**. **Example 2:** **Input:** nums1 = [1,3,5,7,9], nums2 = [3,5,100] **Output:** 109 **Explanation:** Maximum sum is obtained with the path **[1,3,5,100]**. **Example 3:** **Input:** nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10] **Output:** 40 **Explanation:** There are no common elements between nums1 and nums2. Maximum sum is obtained with the path [6,7,8,9,10]. **Constraints:** * 1 <= nums1.length, nums2.length <= 105 * 1 <= nums1[i], nums2[i] <= 107 * `nums1` and `nums2` are strictly increasing.

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxSum

      public int maxSum(int[] nums1, int[] nums2)