Skip to content

Create 523. Continuous Subarray Sum #498

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 8, 2024
Merged

Create 523. Continuous Subarray Sum #498

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions 523. Continuous Subarray Sum
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution {
public:
bool checkSubarraySum(vector<int>& nums, int k) {

int n = nums.size();
int sum = 0;
map<int,int>ma;

ma[0] = -1;

for(int i=0;i<n;i++){
sum+=nums[i];

if(ma.find(sum%k)!=ma.end()){

int foundAt = ma[sum%k];
if(i-foundAt>=2){
return true;
}
}
else{
ma[sum%k] = i;
}
}
return false;
}
};
Loading