forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_616.java
63 lines (57 loc) · 1.87 KB
/
_616.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
61
62
63
package com.fishercoder.solutions;
/**
* 616. Add Bold Tag in String
*
* Given a string s and a list of strings dict,
* you need to add a closed pair of bold tag <b> and </b>
* to wrap the substrings in s that exist in dict.
* If two such substrings overlap, you need to wrap them together by only one pair of closed bold tag.
* Also, if two substrings wrapped by bold tags are consecutive, you need to combine them.
Example 1:
Input:
s = "abcxyz123"
dict = ["abc","123"]
Output:
"<b>abc</b>xyz<b>123</b>"
Example 2:
Input:
s = "aaabbcc"
dict = ["aaa","aab","bc"]
Output:
"<b>aaabbc</b>c"
Note:
The given dict won't contain duplicates, and its length won't exceed 100.
All the strings in input have length in range [1, 1000].
*/
public class _616 {
public static class Solution1 {
/**
* credit: https://discuss.leetcode.com/topic/92112/java-solution-boolean-array
*/
public String addBoldTag(String s, String[] dict) {
boolean[] shouldBold = new boolean[s.length()];
for (int i = 0, end = 0; i < s.length(); i++) {
for (String word : dict) {
if (s.startsWith(word, i)) {
end = Math.max(end, i + word.length());
}
}
shouldBold[i] = end > i;
}
StringBuilder stringBuilder = new StringBuilder();
for (int i = 0; i < s.length(); i++) {
if (!shouldBold[i]) {
stringBuilder.append(s.charAt(i));
continue;
}
int j = i;
while (j < s.length() && shouldBold[j]) {
j++;
}
stringBuilder.append("<b>" + s.substring(i, j) + "</b>");
i = j - 1;
}
return stringBuilder.toString();
}
}
}