Create 789. Escape The Ghosts.py

789. Escape The Ghosts.py

@@ -0,0 +1,37 @@
+"""
+You are playing a simplified PAC-MAN game on an infinite 2-D grid. You start at the point [0, 0], 
+and you are given a destination point target = [xtarget, ytarget] that you are trying to get to. 
+There are several ghosts on the map with their starting positions given as a 2D array ghosts, 
+where ghosts[i] = [xi, yi] represents the starting position of the ith ghost. All inputs are integral coordinates.
+
+Each turn, you and all the ghosts may independently choose to either move 1 unit in any of the four cardinal directions: north, east, south, or west, or stay still. 
+All actions happen simultaneously.
+
+You escape if and only if you can reach the target before any ghost reaches you. If you reach any square (including the target) at the same time as a ghost, 
+it does not count as an escape.
+
+Return true if it is possible to escape regardless of how the ghosts move, otherwise return false.
+
+Author: Krishna
+"""
+
+"""
+Approach: 
+1 . first we will find the minmum distance by which player can able to reach the destination.
+Note: Minimum distance is calculated using the manhattan distances
+2 . We will find the distance from evary ghost to target. 
+3 . if ghost distance is smaller than player distance then return false or else true
+"""
+
+class Solution:
+    def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool:
+        total_dist = abs(target[0]) + abs(target[1])
+        for ghost in ghosts:
+            ghost_dist = abs(target[0]-ghost[0]) + abs(target[1]-ghost[1])
+            print(total_dist,ghost_dist)
+            if(ghost_dist<=total_dist):
+                return False
+        return True
+
+if __name__=="__main__":
+    print Solution().escapeGhosts([[1,0],[0,3]], [0,1])