-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDIStringMatch.cpp
94 lines (80 loc) · 1.87 KB
/
DIStringMatch.cpp
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
<<<<<<< HEAD
class Solution {
public:
vector<int> diStringMatch(string s) {
vector<int>ans;
int i=0,mx=0,n=s.length();
if(s[0]=='D'){
int j=1;
while(j<n && s[j]=='D')
j++;
int k=j;
while(i<k){
ans.push_back(j--),
i++;
}
ans.push_back(j--);
mx=i;
}else{
ans.push_back(0);
}
mx++;
while(i<n){
if(s[i]=='I'){
int j=i+1;
while(j<n && s[j]=='D'){
mx++;
j++;
}
int k=mx;
while(i<j){
ans.push_back(k);
k--;
i++;
}
}
mx++;
}
return ans;
}
=======
class Solution {
public:
vector<int> diStringMatch(string s) {
vector<int>ans;
int i=0,mx=0,n=s.length();
if(s[0]=='D'){
int j=1;
while(j<n && s[j]=='D')
j++;
int k=j;
while(i<k){
ans.push_back(j--),
i++;
}
ans.push_back(j--);
mx=i;
}else{
ans.push_back(0);
}
mx++;
while(i<n){
if(s[i]=='I'){
int j=i+1;
while(j<n && s[j]=='D'){
mx++;
j++;
}
int k=mx;
while(i<j){
ans.push_back(k);
k--;
i++;
}
}
mx++;
}
return ans;
}
>>>>>>> 20843e6664516c6814c0e970cfafb680d978dfd5
};