Most Stones Removed with Same Row or Column
On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.
Now, a move consists of removing a stone that shares a column or row with another stone on the grid.
What is the largest possible number of moves we can make?
Input: stones = [[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]] Output: 5
Input: stones = [[0,0],[0,2],[1,1],[2,0],[2,2]] Output: 3
Input: stones = [[0,0]] Output: 0
- 1 <= stones.length <= 1000
- 0 <= stones[i][j] < 10000
Credits To: leetcode.com
Leave me comments, if you have better ways to solve.
- Solution: XXX
Walk Through Testdata
// Blog link: https://code.dennyzhang.com/most-stones-removed-with-same-row-or-column