-
Notifications
You must be signed in to change notification settings - Fork 0
/
SubArraySumsToX.java
47 lines (42 loc) · 1.17 KB
/
SubArraySumsToX.java
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
/**
* SubArraySumsToX
* Level: Medium
* Given an array of positive and negative integers, find a subarray whose sum equals X.
* <p>
* For example:
* Input = [2,4,-2,1,-3,5,-3], X = 5
* Result = [2,4,-2,1]
*/
package subarrayProblems;
import javafx.util.Pair;
import java.util.HashMap;
import java.util.Map;
import static util.Utils.checkIfArrayIsNull;
import static util.Utils.printInput;
/**
* @author mandeep
*/
public class SubArraySumsToX {
public static void main(String args[]) {
Integer[] arr = {2, 4, -2, 1, -3, 5, -3};
int target = 5;
printInput(subarraySumsToX(arr, target));
}
private static Pair subarraySumsToX(Integer[] arr, int target) {
if (checkIfArrayIsNull(arr))
return null;
int sum = 0;
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < arr.length; i++) {
sum += arr[i];
if (sum == target) {
return new Pair<>(0, i);
}
if (map.containsKey(sum - target)) {
return new Pair<>(map.get(sum - target) + 1, i);
}
map.put(sum, i);
}
return null;
}
}