[LeetCode] Bold Words in String 字符串中的加粗单词
Given a set of keywords words and a string S, make all appearances of all keywords in S bold. Any letters between <b> and </b> tags ...
原文：[LeetCode] Add Bold Tag in String 字符串中增添加粗标签
Given a stringsand a list of stringsdict, you need to add a closed pair of bold tag lt b gt and lt b gt to wrap the substrings in s that exist in dict. If two such substrings overlap, you need to wra ...
2017-06-18 07:02 2 7822 推荐指数：
相关推荐
[LeetCode] Find And Replace in String 在字符串中查找和替换
To some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the same size). Each ...
[LeetCode] Permutation in String 字符串中的全排列
Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's ...
[LeetCode] Reverse Words in a String 翻转字符串中的单词
Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update ...
[LeetCode] Magical String 神奇字符串
A magical string S consists of only '1' and '2' and obeys the following rules: The string S is magical because ...
[LeetCode] Unique Substrings in Wraparound String 封装字符串中的独特子字符串
Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like ...
[LeetCode] Rotate String 旋转字符串
We are given two strings, A and B. A shift on A consists of taking string A and moving the leftmost character to the rightmost position. ...
[LeetCode] String Compression 字符串压缩
Given an array of characters, compress it in-place. The length after compression must always be ...