Time: 270 ms (34.62%), Space: 84.1 MB (79.62%) - LeetHub

1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+  int maxNonOverlapping(vector<int>& nums, int target) {
+    unordered_map<int, int> dp;
+    dp[0] = -1;
+    int sum = 0, right = -1, cnt = 0;
+    for (int i = 0; i < nums.size(); ++i) {
+        sum += nums[i];
+        if (dp.count(sum - target)) {
+            int left = dp[sum - target];
+            if (right <= left) {
+                cout<<i<<" ";
+                ++cnt;
+                right = i;
+            }
+        }
+        dp[sum] = i;
+    }
+    return cnt;
+}
+};