-
Notifications
You must be signed in to change notification settings - Fork 0
/
1544. Make The String Great
122 lines (75 loc) · 1.83 KB
/
1544. Make The String Great
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
class Solution {
public String makeGood(String s)
{
if (s.length() == 0 || s.length() == 1)
{
return s;
}
int i = 0;
StringBuilder sb = new StringBuilder();
sb.append(s);
while (i < sb.length() - 1)
{
char leftChar = sb.charAt(i);
char rightChar = sb.charAt(i + 1);
if (Math.abs(leftChar - rightChar) == 32)
{
sb.delete(i, i + 2);
if (i > 0)
{
i--;
}
}
else
{
i++;
}
}
return sb.toString();
}
/*
public String makeGood(String s)
{
Stack<Character> stk = new Stack<>();
for(char c:s.toCharArray())
{
if(!stk.isEmpty() && Math.abs(c-stk.peek()) == 32)
{
stk.pop();
}
else
{
stk.push(c);
}
}
StringBuilder sb = new StringBuilder();
while(!stk.isEmpty())
{
sb.insert(0, stk.pop());
}
return sb.toString();
}
*/
/*
public String makeGood(String s)
{
StringBuilder sb = new StringBuilder();
for(char c : s.toCharArray())
{
if (sb.length() > 0 && isBadPair(sb.charAt(sb.length() - 1), c))
{
sb.deleteCharAt(sb.length() - 1);
}
else
{
sb.append(c);
}
}
return sb.toString();
}
public boolean isBadPair(char a, char b)
{
return a != b && Character.toLowerCase(a) == Character.toLowerCase(b);
}
*/
}