Given an array nums and two sliding windows of size K & L which don’t have any element in common between them, you need to return the maximum sum of elements we can get between both windows.
感觉类似 https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/