1183. Maximum Number of Ones

[altay9]

Resolves: #213

• We can imagine a square at the top left of the matrix.
• We can assume that the matrix itself is a product of copying this square multiple times and cutting the edges according to the matrix size.
• Then we can assign an id for each tile of the square. (Just like we have done in 305. Number of Islands II #329 with getNodeId())

We need to count how many times each tile id could repeat (if the tile would have been selected to set 1 in it)
Then we select top n (=maxOnes) tiles that repeat most in order to get the maximum benefit.
(We could also use a PQ instead of sorting the array.)

[ErdemT09]

This seems to me like a combination of graph and array problems. The image and the concise explanation helps a lot with the understanding. Once again, thank you for your contribution.
Approved.