leetcode 780. Reaching Points

题目:

A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).

Given a starting point (sx, sy) and a target point (tx, ty), return True if and only if a sequence of moves exists to transform the point (sx, sy) to (tx, ty). Otherwise, return False.

Examples:
Input: sx = 1, sy = 1, tx = 3, ty = 5
Output: True
Explanation:
One series of moves that transforms the starting point to the target is:
(1, 1) -> (1, 2)
(1, 2) -> (3, 2)
(3, 2) -> (3, 5)

Input: sx = 1, sy = 1, tx = 2, ty = 2
Output: False

Input: sx = 1, sy = 1, tx = 1, ty = 1
Output: True

思路:

(tx,ty)肯定是(tx-ty,ty)变来的(tx>ty),递归求解。需要注意的是当1,1,1000000,1时递归很大,需要剪枝,判断可以直接由另一个不断叠加而来就行。

class Solution {
public:
    bool reachingPoints(int sx, int sy, int tx, int ty) {
        if(tx == sx&&ty == sy) return true;
        if(tx<sx||ty<sy) return false;
        if(tx==sx&&ty!=sy){
            if((ty-sy)%sx==0){
                return true;
            } else {
                return false;
            }
        } 
        if(tx!=sx&&ty==sy) {
            if((tx-sx)%sy==0){
                return true;
            } else {
                return false;
            }
        }
        
        if(tx>ty) {
            return reachingPoints(sx,sy,tx-ty,ty);
        } else {
            return reachingPoints(sx,sy,tx,ty-tx);
        }
    }
};

阅读更多
个人分类: LeetCode
上一篇leetcode 754. Reach a Number
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭