Equal Rational Numbers — LeetCode 972 Python Solution
HardMathString
- Problem
- #972
- Pattern
- Math and Number Theory
- Reading time
- 2 min
- Source
- leetcode.com
The problem
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.
Example
- 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.
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) or O(1) |
| Space | O(1) auxiliary |
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 972. Equal Rational Numbers is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 972. Equal Rational Numbers?
- LeetCode 972. Equal Rational Numbers is rated Hard on LeetCode.
- What topics does LeetCode 972. Equal Rational Numbers cover?
- LeetCode 972. Equal Rational Numbers is tagged Math and String on LeetCode.