Easy

Find Positive Integer Solution for a Given EquationC++

Full explanation · Time O(n) · Space O(1)

// Time:  O(n)
// Space: O(1)

/*
 * // This is the custom function interface.
 * // You should not implement it, or speculate about its implementation
 * class CustomFunction {
 * public:
 *     // Returns f(x, y) for any given positive integers x and y.
 *     // Note that f(x, y) is increasing with respect to both x and y.
 *     // i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
 *     int f(int x, int y);
 * };
 */

class Solution {
public:
    vector<vector<int>> findSolution(CustomFunction& customfunction, int z) {
        vector<vector<int>> result;
        int x = 1, y = 1;
        while (customfunction.f(x, y) < z) {
            ++y;
        }
        while (y > 0) {
            while (y > 0 && customfunction.f(x, y) > z) {
                --y;
            }
            if (y > 0 && customfunction.f(x, y) == z) {
                result.push_back({x, y});
            }
            ++x;
        }
        return result;
    }
};