[leetcode] 361. Bomb Enemy 解題報告

題目連接:https://leetcode.com/problems/bomb-enemy/python Given a 2D grid, each cell is either a wall 'Y', an enemy 'X' or empty '0' (the number zero), return the maximum enemies you can kill using one bom

>>阅读原文<<