leetcode - 832.Flipping an Image -Java

Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.

To flip an image horizontally means that each row of the image is reversed. For example, flipping [1, 1, 0] horizontally results in [0, 1, 1].

To invert an image means that each 0 is replaced by 1, and each 1 is replaced by 0. For example, inverting [0, 1, 1] results in [1, 0, 0].

Example 1:

Input: [[1,1,0],[1,0,1],[0,0,0]]
Output: [[1,0,0],[0,1,0],[1,1,1]]
Explanation: First reverse each row: [[0,1,1],[1,0,1],[0,0,0]].
Then, invert the image: [[1,0,0],[0,1,0],[1,1,1]]

Example 2:

Input: [[1,1,0,0],[1,0,0,1],[0,1,1,1],[1,0,1,0]]
Output: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]
Explanation: First reverse each row: [[0,0,1,1],[1,0,0,1],[1,1,1,0],[0,1,0,1]].
Then invert the image: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]

Notes: 1 <= A.length = A[0].length <= 20 0 <= A[i][j] <= 1

题目描述大概就是给一个矩阵，先将矩阵的每一行镜像翻转，再进行反转即 1 => 0 , 0 => 1

public class Flipping {
    public int[][] flipAndInvertImage(int[][] A) {
        int length  = A.length;
        for (int i = 0; i < length; i++) {
            for (int j = 0; j < (A[i].length +1) / 2; j++) {
            //从左数第i个和从右数第i个互为镜像且反转
            //根据当前row[i] = row[C - i - 1] ^ 1(^两边相同为0，两边不同为1)
                int tmp = A[i][j];
                A[i][j] = A[i][length - j -1] ^ 1;
                A[i][length - j -1] = tmp ^ 1;
            }
        }
        return A;
    }
}