1237. Find Positive Integer Solution for a Given Equation
https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation
Description
Given a callable function f(x, y)
with a hidden formula and a value z
, reverse engineer the formula and return all positive integer pairs x
and y
where f(x,y) == z
. You may return the pairs in any order.
While the exact formula is hidden, the function is monotonically increasing, i.e.:
f(x, y) < f(x + 1, y)
f(x, y) < f(x, y + 1)
The function interface is defined like this:
We will judge your solution as follows:
The judge has a list of
9
hidden implementations ofCustomFunction
, along with a way to generate an answer key of all valid pairs for a specificz
.The judge will receive two inputs: a
function_id
(to determine which implementation to test your code with), and the targetz
.The judge will call your
findSolution
and compare your results with the answer key.If your results match the answer key, your solution will be
Accepted
.
Example 1:
Example 2:
Constraints:
1 <= function_id <= 9
1 <= z <= 100
It is guaranteed that the solutions of
f(x, y) == z
will be in the range1 <= x, y <= 1000
.It is also guaranteed that
f(x, y)
will fit in 32 bit signed integer if1 <= x, y <= 1000
.
ac
Last updated