<p>Given two strings <code>s</code> and <code>t</code>, each of which represents a non-negative rational number, return <code>true</code> if and only if they represent the same number. The strings may use parentheses to denote the repeating part of the rational number.</p>
<p>A <strong>rational number</strong> can be represented using up to three parts: <code><IntegerPart></code>, <code><NonRepeatingPart></code>, and a <code><RepeatingPart></code>. The number will be represented in one of the following three ways:</p>
<ul>
<li><code><IntegerPart></code>
<ul>
<li>For example, <code>12</code>, <code>0</code>, and <code>123</code>.</li>
<strong>Input:</strong> s = "0.(52)", t = "0.5(25)"
<strong>Output:</strong> true
<strong>Explanation:</strong> Because "0.(52)" represents 0.52525252..., and "0.5(25)" represents 0.52525252525..... , the strings represent the same number.
<strong>Input:</strong> s = "0.9(9)", t = "1."
<strong>Output:</strong> true
<strong>Explanation:</strong>"0.9(9)" represents 0.999999999... repeated forever, which equals 1. [<ahref="https://en.wikipedia.org/wiki/0.999..."target="_blank">See this link for an explanation.</a>]
"1." represents the number 1, which is formed correctly: (IntegerPart) = "1" and (NonRepeatingPart) = "".
</pre>
<p> </p>
<p><strong>Constraints:</strong></p>
<ul>
<li>Each part consists only of digits.</li>
<li>The <code><IntegerPart></code> does not have leading zeros (except for the zero itself).</li>