leetcode#789. Escape The Ghosts

789. Escape The Ghosts

Problem Description

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.

Solution

Don’t consider the relative positions between ghosts and you. Just let all of guests and you go to the target point directly. If you are the first to arrive, you escape. Use L1-norm to calculate the distance rather than L2-norm. Here is the code:

class Solution {
public:
    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {
        int dis = abs(target[0]) + abs(target[1]);
        for (int i=0; i<ghosts.size(); i++) {
            int tmp = abs(ghosts[i][0] - target[0]) + abs(ghosts[i][1] - target[1]);
            if (tmp <= dis) return false;
        }
        return true;
    }
};

However, there’s a strange test case causes unexpected result when I use L2-norm. Here is a record:

Input:  [[5,0],[-10,-2],[0,-5],[-2,-2],[-7,1]]
        [7,7]
Output: true
Expected: false