616. Add Bold Tag in String
package LeetCode_616 import java.util.* import kotlin.collections.HashSet /** * 616. Add Bold Tag in String * (Prime) * 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: 1. The given dict won't contain duplicates, and its length won't exceed 100. 2. All the strings in input have length in range [1, 1000]. * */ class Solution { /* * solution: use array to record current latter if need bold; * Time complexity:O(n^3), Space complexity:O(n+d) * n=s.length * d=words.size * */ fun addBoldTag(words: List<String>, s: String): String { val set = HashSet<String>() set.addAll(words) val n = s.length //1 represent need bold val bolded = IntArray(n) /*checking each sub-string * for example: aabcd, checking order like: * 1. a,aa,aab,aabc,aabcd * 2. a,ab,abc,abcd * 3. b,bc,bcd * 4. c,cd,d * */ for (i in 0 until n) { for (j in 1 .. n - i) { if (set.contains(s.substring(i, i+j))) { //0,1,1,1,0, Arrays.fill(bolded, i, i + j, 1) } } } bolded.forEach { print("$it,") } //set the result by boled array val sb = StringBuilder() for (i in 0 until n) { if (bolded[i] == 1 && (i == 0 || bolded[i - 1] != 1)) { sb.append("<b>") } sb.append(s[i]) //add </b> in the last, so check if(i==n-1) if (bolded[i] == 1 && (i == n - 1 || bolded[i + 1] != 1)) { sb.append("</b>") } } println(sb.toString()) return sb.toString() } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)
2019-09-08 905. Sort Array By Parity