[LeetCode] 947. Most Nodes Removed - Road to Glory - SegmentFault 思否

[LeetCode] 947. Most Nodes Removed - Road to Glory - SegmentFault 思否

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?

Example 1:

Input: stones = [[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]]
Output: 5
Example 2:

Input: stones = [[0,0],[0,2],[1,1],[2,0],[2,2]]
Output: 3
Example 3:

Read full article from [LeetCode] 947. Most Nodes Removed - Road to Glory - SegmentFault 思否