C++bitmask陣列切割解Leetcode難題3197 Find the Minimum Area to Cover All Ones II

C++bitmask陣列切割解Leetcode難題3197  Find the Minimum Area to Cover All Ones II

這是個立方時間的解答，主要採bitmask陣列法表達矩陣，應該沒人這樣做，最快時間已達8ms擊敗100%的C++參與者。

---------------

This is a cubic time solution, which mainly uses the bitmask array method to express the matrix. It is unlikely that anyone would do this. The fastest time has reached 8ms, beating 100% of the C++ participants.

[codes on Leetcode]https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii/solutions/7111740/bitmask-1d-array-for-grid-its-transpose-deal-with-6-cases-8ms-beats-100/