鏡花水月-什麼是真?什麼是假?

題目:832.Flipping an Image

難度:簡單

題目:

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].

• 1 <= A.length = A[0].length <= 20
• 0 <= A[i][j] <= 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]]

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]]

中文說明:

本題是要把每個小框框的字串反轉後，再把0->1，1->0，結束

所以我們用for迴圈即可達到

以下程式碼:

class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
        int i,j,k;
        for( i=0;i<A.size();i++)
        {for(j=0,k=A[i].size()-1;j<k;j++,k--)
           {
             int t=A[i][j];
             A[i][j]=A[i][k];
            A[i][k]=t;
           }  
        }//將每個字串先反轉

    for( i=0;i<A.size();i++)
        {for(j=0;j<A[i].size();j++)
           {
             if(A[i][j]==0)A[i][j]=1;
             else A[i][j]=0;
           } 
        }//字串0,1轉換
        return A;
    }
};

以上，收工!!