-
Notifications
You must be signed in to change notification settings - Fork 0
/
1903.largest-odd-number-in-string.java
60 lines (31 loc) · 1.14 KB
/
1903.largest-odd-number-in-string.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
54
55
56
57
58
59
60
class Solution {
public int maximumRemovals(String s, String p, int[] removable) {
char[] chary = s.toCharArray();
int l = 0;
int r = removable.length-1;
while(l<=r){
int mid = (l+r)/2;
for(int i=0;i<=mid;i++)
chary[removable[i]] = '/';
if(same(chary, p)){
l = mid+1;
}
else{
for(int i=0;i<=mid;i++)
chary[removable[i]] = s.charAt(removable[i]);
r= mid-1;
}
}
return l;
}
public boolean same(char[] ary, String tar){
int l= 0;
int r = 0;
while(l<ary.length && r<tar.length()){
if(ary[l] == tar.charAt(r))
r++;
l++;
}
return r == tar.length();
}
}