add 758

Author: fishercoder1534

README.md

@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |763|[Partition Labels](https://leetcode.com/problems/partition-labels/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_763.java) | O(n) | O(1) | |Medium|
 |762|[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_762.java) | O(n) | O(1) | |Easy|
 |760|[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_760.java) | O(n^2) | O(1) | |Easy| 
+|758|[Bold Words in String](https://leetcode.com/problems/bold-words-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_758.java) | O(n*k) | O(n | |Easy|
 |756|[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_756.java) | O(?) | O(?) | |Medium| Backtracking
 |755|[Pour Water](https://leetcode.com/problems/pour-water/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_755.java) | O(V*N) | O(1) | |Medium| Array
 |754|[Reach a Number](https://leetcode.com/problems/reach-a-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_754.java) | O(n) | O(1) | |Medium| Math

src/main/java/com/fishercoder/solutions/_758.java

@@ -0,0 +1,49 @@
+package com.fishercoder.solutions;
+
+/**
+ * 758. 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 become bold.
+ * The returned string should use the least number of tags possible, and of course the tags should form a valid combination.
+ * For example, given that words = ["ab", "bc"] and S = "aabcd", we should return "a<b>abc</b>d".
+ * Note that returning "a<b>a<b>b</b>c</b>d" would use more tags, so it is incorrect.
+
+ Note:
+
+ words has length in range [0, 50].
+ words[i] has length in range [1, 10].
+ S has length in range [0, 500].
+ All characters in words[i] and S are lowercase letters.
+
+ */
+
+public class _758 {
+  public static class Solution1 {
+    /**Interestingly, this problem is exactly the same as 616, using 616's code could get it AC'ed.*/
+    public String boldWords(String[] words, String S) {
+      boolean[] shouldBold = new boolean[S.length()];
+      for (int i = 0, end = 0; i < S.length(); i++) {
+        for (String word : words) {
+          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();
+    }
+  }
+}

src/test/java/com/fishercoder/_758Test.java

@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._758;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _758Test {
+  private static _758.Solution1 solution1;
+  private static String[] words;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _758.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    words = new String[] {"ab", "bc"};
+    assertEquals("a<b>abc</b>d", solution1.boldWords(words, "aabcd"));
+  }
+
+  @Test
+  public void test2() {
+    words = new String[] {"ccb", "b", "d", "cba", "dc"};
+    assertEquals("eeaa<b>d</b>a<b>d</b>a<b>dc</b>", solution1.boldWords(words, "eeaadadadc"));
+  }
+}