Skip to content
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.

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

Create lt-maxsubarray.cpp #36

Merged
merged 1 commit into from
Jan 25, 2022
Merged

Create lt-maxsubarray.cpp #36

merged 1 commit into from
Jan 25, 2022

Conversation

MrcRjs
Copy link
Owner

@MrcRjs MrcRjs commented Jan 25, 2022

325. Maximum Size Subarray Sum Equals k

Given an integer array nums and an integer k, return the maximum length of a subarray that sums to k. If there is not one, return 0 instead.

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.

@MrcRjs MrcRjs merged commit 867a655 into master Jan 25, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant