JAVA || DFS || C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maximumDetonation(int[][] bombs) {\n        int ans  = 0;\n        int n = bombs.length;\n        boolean[] visited = new boolean[n];\n        int var;\n        for(int i=0; i<n; i++) {\n            Arrays.fill(visited, false);\n            var = dfs(i, bombs, visited);\n            ans = Math.max(ans, var);\n        }\n        return ans;\n    }\n\n    int dfs(int ind, int[][] bombs, boolean[] visited) {\n        visited[ind]=true;\n        long r = bombs[ind][2];\n        r = r*r;\n        int ans = 0;\n        for(int i=0; i<bombs.length; i++) {\n            if(i==ind || visited[i])\n            continue;\n            long xDiff = (bombs[ind][0]-bombs[i][0]);\n            long yDiff = (bombs[ind][1]-bombs[i][1]);\n            long dis = xDiff*xDiff + yDiff*yDiff;\n            if(dis<=r) {\n                ans+=dfs(i, bombs, visited);\n            }\n        }\n        return ans+1;\n    }\n}\n```
['Depth-First Search', 'C++', 'Java']