Package g1001_1100.s1092_shortest_common_supersequence

Class Solution

java.lang.Object
g1001_1100.s1092_shortest_common_supersequence.Solution
public class Solution extends Object
1092 - Shortest Common Supersequence.<p>Hard</p> <p>Given two strings <code>str1</code> and <code>str2</code>, return <em>the shortest string that has both</em> <code>str1</code> <em>and</em> <code>str2</code> <em>as <strong>subsequences</strong></em>. If there are multiple valid strings, return <strong>any</strong> of them.</p> <p>A string <code>s</code> is a <strong>subsequence</strong> of string <code>t</code> if deleting some number of characters from <code>t</code> (possibly <code>0</code>) results in the string <code>s</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> str1 = &ldquo;abac&rdquo;, str2 = &ldquo;cab&rdquo;</p> <p><strong>Output:</strong> &ldquo;cabac&rdquo;</p> <p><strong>Explanation:</strong></p> <p>str1 = &ldquo;abac&rdquo; is a subsequence of &ldquo;cabac&rdquo; because we can delete the first &ldquo;c&rdquo;.</p> <p>str2 = &ldquo;cab&rdquo; is a subsequence of &ldquo;cabac&rdquo; because we can delete the last &ldquo;ac&rdquo;.</p> <p>The answer provided is the shortest such string that satisfies these properties.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> str1 = &ldquo;aaaaaaaa&rdquo;, str2 = &ldquo;aaaaaaaa&rdquo;</p> <p><strong>Output:</strong> &ldquo;aaaaaaaa&rdquo;</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= str1.length, str2.length <= 1000</code></li> <li><code>str1</code> and <code>str2</code> consist of lowercase English letters.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • shortestCommonSupersequence

      public String shortestCommonSupersequence(String str1, String str2)