Leetcode Problem 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix

Algorithm

1. Enumerate all possible decisions for the first row.
2. For each decision, initialize lastState with the decision and changed with all zeros.
3. For each row in the matrix, calculate the state based on changed.
4. For each cell in the current row, if lastState at that cell is 1, flip the current cell and its neighbors, and increment the flip counter.
5. Update changed and lastState for the next row.
6. After processing all rows, check if lastState is all zeros to determine if the solution is valid.
7. Repeat steps 2-6 for all decisions of the first row and keep track of the minimum number of flips.
8. Return the minimum number of flips or -1 if no valid solution exists.