-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
525.java
53 lines (51 loc) · 1.53 KB
/
525.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
48
49
50
51
52
53
__________________________________________________________________________________________________
sample 5 ms submission
class Solution {
public int findMaxLength(int[] nums) {
int n = nums.length;
int len = 2 * n + 1;
int[] f = new int[len];
for(int i=0; i<len; i++) f[i] = -2;
int s = 0;
int ret = 0;
f[n] = -1;
for(int i=0; i<n; i++) {
s += (nums[i]==0? -1: 1);
if(f[s+n]!=-2){
ret = Math.max(ret, i-f[s+n]);
}
else f[s+n] = i;
}
return ret;
}
}
__________________________________________________________________________________________________
sample 52188 kb submission
class Solution {
public int findMaxLength(int[] nums) {
int sum =0;
int maxLen=0;
int endIndex = 0;
Map<Integer,Integer> m = new HashMap<>();
for(int i=0;i<nums.length;i++){
if(nums[i]==0)
nums[i]=-1;
}
for(int i=0;i<nums.length;i++){
sum =sum + nums[i];
if(sum==0){
maxLen = i+1;
endIndex = i;
}
if(m.containsKey(sum)){
if(maxLen< i-m.get(sum)){
maxLen = i - m.get(sum);
endIndex =i;
}
}else
m.put(sum,i);
}
return maxLen;
}
}
__________________________________________________________________________________________________