1. 程式人生 > >832Flipping an Image

832Flipping an Image

nta reverse pan int 數組 length 解題思路 == clas

/*
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

/*
解題思路,先翻轉數組,然後把0與1互換結束,很簡單
*/
class Solution {
    public int[][] flipAndInvertImage(int[][] A) {
        int m = A.length;
        int n = A[0].length;
        int temp;
        for(int k=0;k<m;k++){
            for( int i = 0 ; i < n/2; i++ ){
                temp        =  A[k][i];
                A[k][i]     
= A[k][n-i-1]; A[k][n-i-1] = temp; } } for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ if(A[i][j]==1) A[i][j]=0; else A[i][j]=1; } }
return A; } }

832Flipping an Image