Class Solution
java.lang.Object
g0901_1000.s0947_most_stones_removed_with_same_row_or_column.Solution
947 - Most Stones Removed with Same Row or Column.<p>Medium</p>
<p>On a 2D plane, we place <code>n</code> stones at some integer coordinate points. Each coordinate point may have at most one stone.</p>
<p>A stone can be removed if it shares either <strong>the same row or the same column</strong> as another stone that has not been removed.</p>
<p>Given an array <code>stones</code> of length <code>n</code> where <code>stones[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents the location of the <code>i<sup>th</sup></code> stone, return <em>the largest possible number of stones that can be removed</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> stones = [[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]]</p>
<p><strong>Output:</strong> 5</p>
<p><strong>Explanation:</strong> One way to remove 5 stones is as follows:</p>
<ol>
<li>Remove stone [2,2] because it shares the same row as [2,1].</li>
<li>Remove stone [2,1] because it shares the same column as [0,1].</li>
<li>Remove stone [1,2] because it shares the same row as [1,0].</li>
<li>Remove stone [1,0] because it shares the same column as [0,0].</li>
<li>Remove stone [0,1] because it shares the same row as [0,0].</li>
</ol>
<p>Stone [0,0] cannot be removed since it does not share a row/column with another stone still on the plane.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> stones = [[0,0],[0,2],[1,1],[2,0],[2,2]]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> One way to make 3 moves is as follows:</p>
<ol>
<li>
<p>Remove stone [2,2] because it shares the same row as [2,0].</p>
</li>
<li>
<p>Remove stone [2,0] because it shares the same column as [0,0].</p>
</li>
<li>
<p>Remove stone [0,2] because it shares the same row as [0,0].</p>
</li>
</ol>
<p>Stones [0,0] and [1,1] cannot be removed since they do not share a row/column with another stone still on the plane.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> stones = [[0,0]]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Explanation:</strong> [0,0] is the only stone on the plane, so you cannot remove it.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= stones.length <= 1000</code></li>
<li><code>0 <= x<sub>i</sub>, y<sub>i</sub> <= 10<sup>4</sup></code></li>
<li>No two stones are at the same coordinate point.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
removeStones
public int removeStones(int[][] stones)
-