GoLang Solution For LeetCode Problem: Most Stones Removed with Same Row or Column
Solving Most Stones Removed with Same Row or Column in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.
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:
Input: stones = [[0,0]]
Output: 0
Note:
1 <= stones.length <= 1000
0 <= stones[i][j] < 10000
- 1 <= stones.length <= 1000
- 0 <= stones[i][j] < 10000
See the full details of the problem Most Stones Removed with Same Row or Column at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.