力扣1546.和為目標值且不重疊的非空子數組的最大數目

• 從頭開始找 找到滿足條件的就清空哈希表

•   class Solution {public:int maxNonOverlapping(vector<int>& nums, int target) {int n = nums.size();vector<int> s(n+1);for(int i=0;i<n;i++) s[i+1] = s[i] + nums[i];unordered_map<int,int> cnt;int res=0;for(int sj:s){if(cnt.find(sj - target) != cnt.end()){res ++;cnt = unordered_map<int,int> {};}cnt[sj] ++;}return res;}};