Maximum Sum Subarray of Size K (easy)

/*
Given an array nums and a target value k, find the maximum length of a subarray that sums to k. 
If there isn't one, return 0 instead.

Note:
The sum of the entire nums array is guaranteed to fit within the 32-bit signed integer range.

Example 1:

Input: nums = [1, -1, 5, -2, 3], k = 3
Output: 4 
Explanation: The subarray [1, -1, 5, -2] sums to 3 and is the longest.
Example 2:

Input: nums = [-2, -1, 2, 1], k = 1
Output: 2 
Explanation: The subarray [-1, 2] sums to 1 and is the longest.
Follow Up:
Can you do it in O(n) time?
    */ 

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
class Solution {
public:
	
    int maxSubArrayLen(vector<int>& nums, int k) {
    	int sum=0;
    	int res=0;
    	unordered_map<int,int> smap;
           //设置一个map，保存和目标k的差值对应的i（位置）
            
		for(int i=0;i<nums.size();i++){
			//1.得到累加和
			sum+=nums[i];
			if(sum==k){
				//如果刚好等于k,证明这是当前累加最长结果
				res=i+1; 
			}else if(smap.count(sum-k)!=0){
				//count返回键值等于key的元素的个数
				//2.如果hash表存在这样的值,则和res比较大小，确定一个最长的结果 
				res=max(res,i-smap[sum-k]);
			}
			//hash表只存元素第一次出现的位置 
			//3.如果hash表不存在这样的元素，则添加进去 
			if(smap.count(sum)==0){
				smap[sum]=i;
			}
		}
		return res;
    }
};
int main(){
	int k=3;
	vector< int > nums{-2, -1, 2, 1};
	Solution sl;
	cout<<sl.maxSubArrayLen(nums,k);
	return 0;
}