Given two strings S
and T
, each of which represents a non-negative rational number, return True if and only if they represent the same number. The strings may use parentheses to denote the repeating part of the rational number.
In general a rational number can be represented using up to three parts: an integer part, a non-repeating part, and a repeating part. The number will be represented in one of the following three ways:
<IntegerPart>
(e.g. 0, 12, 123)<IntegerPart><.><NonRepeatingPart>
(e.g. 0.5, 1., 2.12, 2.0001)<IntegerPart><.><NonRepeatingPart><(><RepeatingPart><)>
(e.g. 0.1(6), 0.9(9), 0.00(1212))
The repeating portion of a decimal expansion is conventionally denoted within a pair of round brackets. For example:
1 / 6 = 0.16666666... = 0.1(6) = 0.1666(6) = 0.166(66)
Both 0.1(6) or 0.1666(6) or 0.166(66) are correct representations of 1 / 6.
Example 1:
Input: S = "0.(52)", T = "0.5(25)" Output: true Explanation: Because "0.(52)" represents 0.52525252..., and "0.5(25)" represents 0.52525252525..... , the strings represent the same number.
Example 2:
Input: S = "0.1666(6)", T = "0.166(66)" Output: true
Example 3:
Input: S = "0.9(9)", T = "1." Output: true Explanation: "0.9(9)" represents 0.999999999... repeated forever, which equals 1. [See this link for an explanation.] "1." represents the number 1, which is formed correctly: (IntegerPart) = "1" and (NonRepeatingPart) = "".
Note:
- Each part consists only of digits.
- The
<IntegerPart>
will not begin with 2 or more zeros. (There is no other restriction on the digits of each part.) 1 <= <IntegerPart>.length <= 4
0 <= <NonRepeatingPart>.length <= 4
1 <= <RepeatingPart>.length <= 4
class Solution {
public:
bool isRationalEqual(string S, string T)
{
//for S
int s_index_point = S.find_first_of(".") , s_index_bracket = S.find_first_of("(");
string s_str_inte , s_str_deci , s_str_rep ;
if(s_index_point != string::npos)
{
s_str_inte = S.substr(0 , s_index_point) ;
if(s_index_bracket != string::npos)
{
s_str_deci = S.substr(s_index_point + 1 , s_index_bracket - s_index_point - 1) ;
s_str_rep = S.substr(s_index_bracket + 1 , S.size() - s_index_bracket - 2) ;
}
else
{
s_str_deci = S.substr(s_index_point + 1) ;
}
}
else
{
s_str_inte = S ;
}
//for T
int t_index_point = T.find_first_of("."), t_index_bracket = T.find_first_of("(");
string t_str_inte , t_str_deci , t_str_rep ;
if(t_index_point != string::npos)
{
t_str_inte = T.substr(0 , t_index_point) ;
if(t_index_bracket != string::npos)
{
t_str_deci = T.substr(t_index_point + 1 , t_index_bracket - t_index_point - 1) ;
t_str_rep = T.substr(t_index_bracket + 1 , T.size() - t_index_bracket - 2) ;
}
else
{
t_str_deci = T.substr(t_index_point + 1) ;
}
}
else
{
t_str_inte = T ;
}
cout<<"s_str_rep :"<<s_str_rep<<endl ;
cout<<"t_str_rep :"<<t_str_rep<<endl ;
int s_inte = stoi(s_str_inte) , t_inte = stoi(t_str_inte) ;
if(abs(s_inte - t_inte) > 1) return false;
double num_S , num_T ;
//for S
while(!s_str_rep.empty() && s_str_deci.size() < 10)
{
s_str_deci += s_str_rep ;
}
if(!s_str_deci.empty()) s_str_deci = "0." + s_str_deci ;
cout<<"s_str_deci"<<s_str_deci<<endl;
//for T
while(!t_str_rep.empty() && t_str_deci.size() < 10)
{
t_str_deci += t_str_rep ;
}
if(!t_str_deci.empty()) t_str_deci = "0." + t_str_deci ;
cout<<"t_str_deci:"<<t_str_deci<<endl ;
num_S = (double)s_inte ;
num_T = (double)t_inte ;
if(!s_str_deci.empty()) num_S += stod(s_str_deci) ;
if(!t_str_deci.empty()) num_T += stod(t_str_deci) ;
cout<<num_S<<endl;
cout<<num_T<<endl;
if(abs(num_S - num_T) < 1e-9) return true ;
else return false;
}
};