812. 字符串中的加粗单词

812. 字符串中的加粗单词

 

 

给定一组关键字“words”和一个字符串“S”,将所有关键字以S粗体显示。 <b>  和  </b> 标记之间的任何字母都将加粗。
返回的字符串应该使用尽可能少的标签,当然这些标签应该组成一个有效的组合。

样例

样例 1:
输入:
["ab", "bc"]
"aabcd"
输出:
"a<b>abc</b>d"
 
解释:
"a<b>a<b>b</b>c</b>d" 用了更多的标签,所以不对
样例 2:
输入:
["bcccaeb","b","eedcbda","aeebebebd","ccd","eabbbdcde","deaaea","aea","accebbb","d"]
"ceaaabbbedabbecbcced"
输出:
"ceaaa<b>bbb</b>e<b>d</b>a<b>bb</b>ec<b>b</b>cce<b>d</b>"

注意事项

  • words  长度在 [0, 50] .
  • words[i]  长度在  [1, 10] .
  • S  长度在  [0, 500] .
  • words[i]  和  S  由小写字母组成
 
public class Solution {
    /**
     * @param words: the words
     * @param S: the string
     * @return: the string with least number of tags
     */
    public String boldWords(String[] words, String S) {
        // Write your code here
       StringBuilder stringBuffer = new StringBuilder();
            boolean[] sum = new boolean[S.length()];
            char[] chars=S.toCharArray();
            for (String word : words) {
                char[] chars1 = (word.toCharArray());
                for (int j = 0; j <= chars.length-chars1.length; j++) {
                    boolean has = false;
                    for (int k = 0; k < chars1.length; k++) {
                        if (chars[j+k] == chars1[k]) {
                            has = true;
                        }else{
                            has = false;
                            break;
                        }
                    }
                    if (has){
                        for (int k = j; k <j+chars1.length; k++) {
                            sum[k]=true;
                        }
                    }
                }
            }
            boolean flag = false;
            for (int i = 0; i < sum.length; i++) {
                // System.out.println(i+","+sum[i]);
                if (sum[i]) {
                    if (!flag) {
                        // System.out.println(S.charAt(i));
                        stringBuffer.append("<b>");
                        flag = true;
                    }
                } else {
                    if (flag) {
                        // System.out.println(S.charAt(i));
                        stringBuffer.append("</b>");
                        flag = false;
                    }
                }
                stringBuffer.append(S.charAt(i));
            }
            if (flag) {
                stringBuffer.append("</b>");
            }
            return stringBuffer.toString();
    }
}
 
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

时代我西

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值