LeetCode 325. Maximum Size Subarray Sum Equals k

#include <unordered_map>
#include <iostream>
using namespace std;

/*
  Given an array nums and a target value k, find the maximum length of a subarray that sums to k.
  if there is not one. return 0 instead.
  For example:
  Given nums = [-2, -1, 2, 1], k = 1;
  return 2. because the subarray[-1, 2] sums to 1 and is the longest.
*/
// Time O(N2)
int maximumSubArraySum(vector<int>& nums, int k) {
  int maxSize = -1;
  int sum = 0, i = 0;
  while(i < nums.size()) {
    sum += nums[i];
    int j = 0;
    int tmp = sum;
    while(j < i) {
      if(tmp == k) maxSize = max(maxSize, i - j + 1);
      tmp -= nums[j];
      j++;
    }
    i++;
  }
  return maxSize == -1? -1 : maxSize;
}

// HashMap method. O(N) time complexity.
// The hashmap stores former sum values.
int maximumSubArraySumII(vector<int>& nums, int k) {
  unordered_map<int, int> sumToIndex;
  sumToIndex.insert({0, -1});
  int maxSize = -1;
  int sum = 0;
  for(int i = 0; i < nums.size(); ++i) {
    sum += nums[i];
    int tmp = sum - k;
    auto iter = sumToIndex.find(tmp);
    if(iter != sumToIndex.end()) {
      maxSize = max(maxSize, i - iter->second);
    }
    sumToIndex.insert({sum, i});  // added this line.
 }
  return maxSize == -1? -1 : maxSize;
}

int main(void) {
  vector<int> nums{-2, 1, 2, 1, -1, 1};
  cout << maximumSubArraySumII(nums, 1) << endl;
}