g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings.Solution

public class Solution extends Object

2060 - Check if an Original String Exists Given Two Encoded Strings.Hard An original string, consisting of lowercase English letters, can be encoded by the following steps: <ul> <li>Arbitrarily split it into a sequence of some number of non-empty substrings.</li> <li>Arbitrarily choose some elements (possibly none) of the sequence, and replace each with its length (as a numeric string).</li> <li>Concatenate the sequence as the encoded string.</li> </ul> For example, one way to encode an original string <code>"abcdefghijklmnop"</code> might be: <ul> <li>Split it as a sequence: <code>["ab", "cdefghijklmn", "o", "p"]</code>.</li> <li>Choose the second and third elements to be replaced by their lengths, respectively. The sequence becomes <code>["ab", "12", "1", "p"]</code>.</li> <li>Concatenate the elements of the sequence to get the encoded string: <code>"ab121p"</code>.</li> </ul> Given two encoded strings <code>s1</code> and <code>s2</code>, consisting of lowercase English letters and digits <code>1-9</code> (inclusive), return <code>true</code> if there exists an original string that could be encoded as both <code>s1</code> and <code>s2</code>. Otherwise, return <code>false</code>. Note: The test cases are generated such that the number of consecutive digits in <code>s1</code> and <code>s2</code> does not exceed <code>3</code>. Example 1: Input: s1 = “internationalization”, s2 = “i18n” Output: true Explanation: It is possible that “internationalization” was the original string. <ul> <li> “internationalization” -> Split: [“internationalization”] -> Do not replace any element -> Concatenate: “internationalization”, which is s1. </li> <li> “internationalization” -> Split: [“i”, “nternationalizatio”, “n”] -> Replace: [“i”, “18”, “n”] -> Concatenate: “i18n”, which is s2 </li> </ul> Example 2: Input: s1 = “l123e”, s2 = “44” Output: true Explanation: It is possible that “leetcode” was the original string. <ul> <li> “leetcode” -> Split: [“l”, “e”, “et”, “cod”, “e”] -> Replace: [“l”, “1”, “2”, “3”, “e”] -> Concatenate: “l123e”, which is s1. </li> <li> “leetcode” -> Split: [“leet”, “code”] -> Replace: [“4”, “4”] -> Concatenate: “44”, which is s2. </li> </ul> Example 3: Input: s1 = “a5b”, s2 = “c5b” Output: false Explanation: It is impossible. <ul> <li> The original string encoded as s1 must start with the letter ‘a’. </li> <li> The original string encoded as s2 must start with the letter ‘c’. </li> </ul> Constraints: <ul> <li><code>1 <= s1.length, s2.length <= 40</code></li> <li><code>s1</code> and <code>s2</code> consist of digits <code>1-9</code> (inclusive), and lowercase English letters only.</li> <li>The number of consecutive digits in <code>s1</code> and <code>s2</code> does not exceed <code>3</code>.</li> </ul>

Constructor Summary

Constructors

Constructor

Description

Solution()
Method Summary

Modifier and Type

Method

Description

boolean

possiblyEquals(String s1, String s2)

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- Solution
  
  public Solution()
Method Details
- possiblyEquals
  
  public boolean possiblyEquals(String s1, String s2)

Class Solution

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Details

Solution

Method Details

possiblyEquals