789. Escape The Ghosts(python+cpp)

题目:

You are playing a simplified Pacman game. You start at the point (0, 0), and your destination is (target[0], target[1]). There are several ghosts on the map, the i-th ghost starts at (ghosts[i][0], ghosts[i][1]).
Each turn, you and all ghosts simultaneously may move in one of 4 cardinal directions: north, east, west, or south, going from the previous point to a new point 1 unit of distance away.
You escape if and only if you can reach the target before any ghost reaches you (for any given moves the ghosts may take.) If you reach any square (including the target) at the same time as a ghost, it doesn’t count as an escape.
Return True if and only if it is possible to escape.
Example 1:

Input:  ghosts = [[1, 0], [0, 3]] target = [0, 1] 
Output: true 
Explanation:  You can directly reach the destination (0, 1) at time 1, while the ghosts 
located at (1, 0) or (0, 3) have no way to catch up with you. 

Example 2:

Input:  ghosts = [[1, 0]] target = [2, 0] 
Output: false 
Explanation:  You need to reach the destination (2, 0), but the ghost at (1, 0) lies 
between you and the destination.

Example 3:

Input:  ghosts = [[2, 0]] target = [1, 0] 
Output: false
Explanation:  The ghost can reach the target at the same time as you.

Note:
All points have coordinates with absolute value <= 10000.
The number of ghosts will not exceed 100.

解释:
玩家和鬼可以移动,也可以不移动,也就是说,如果鬼距离目标点更近的话,那么鬼可以在目标点等着玩家到来,玩家必死,所以这道题就是看距离。
python代码:

class Solution(object):
    def escapeGhosts(self, ghosts, target):
        """
        :type ghosts: List[List[int]]
        :type target: List[int]
        :rtype: bool
        """
        target_0,target_1=target[0],target[1]
        playerDis=abs(target_0)+abs(target_1)
        for a,b in ghosts:
            dis=abs(a-target_0)+abs(b-target_1)
            if dis<=playerDis:
                return False
        return True
#include <cmath>
class Solution {
public:
    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {
        int playerDis=abs(target[0])+abs(target[1]);
        for(auto ghost:ghosts)
        {
            int dis=abs(ghost[0]-target[0])+abs(ghost[1]-target[1]);
            if (dis<=playerDis)
                return false;
        }
        return true;
    }
};

总结:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值