-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlongest-subarray-with-k.cpp
More file actions
50 lines (45 loc) · 1.23 KB
/
longest-subarray-with-k.cpp
File metadata and controls
50 lines (45 loc) · 1.23 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<bits/stdc++.h>
using namespace std;
class Solution{
public:
/* int longestSubarray(vector<int> &nums, int k){
int longest = 0;
for (int i=0; i<nums.size(); i++) {
for (int j=i; j<nums.size(); j++) {
int currentSum = 0;
for (int k=i; k<=j; k++) {
currentSum += nums[k];
}
if (currentSum == k) {
longest = max(longest, j-i+1);
}
}
}
return longest;
} */
int longestSubarray(vector<int> nums, int k) {
map<long long, int> mp;
long long sum;
int maxLen = 0;
for (int i=0; i<nums.size(); i++) {
sum += nums[i];
if (sum == k) {
maxLen = max(maxLen, i+1);
}
long long rem = sum - k;
if (mp.find(rem) != mp.end()) {
int len = i - mp[rem];
maxLen = max(len, maxLen);
}
if (mp.find(sum) == mp.end()) {
mp[sum] = i;
}
}
return maxLen;
}
};
int main() {
Solution s1;
vector<int> nums = {1,2,1,2,1};
cout << s1.longestSubarray(nums, 3);
}