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

    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

    解题思路:

    c++有个reverse函数可以实现容器反转,我这里没有用,直接遍历每个vector,交换元素。

    题目不难,但是一直没能实现功能,最终发现是for(auto vec : A)的原因,应该使用for (auto &vec : A)。

    代码:

     1 class Solution {
     2 public:
     3     vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
     4         for (auto& vec : A) {
     5             int i = 0; 
     6             int j = vec.size() - 1;
     7             while (i <= j) {
     8                 int tmp = !vec[j];
     9                 vec[j] = !vec[i];
    10                 vec[i] = tmp;
    11                 ++i;
    12                 --j;
    13             }
    14         }
    15         return A;
    16     }
    17 };
  • 相关阅读:
    vector
    codeforces 1453D. Checkpoints
    [ICPC2019 WF]Hobson's Trains
    [ICPC2019 WF]Circular DNA
    计算几何板子
    CSP-S2020 贪吃蛇(洛谷民间数据)
    CSP-S2020 函数调用(洛谷民间数据)
    [NOI Online #3 提高组]魔法值
    [NOI Online #1 提高组]冒泡排序
    佳能m62套机5500 佳能EOS M50 M6 MARK2 II二代 最低到过5800
  • 原文地址:https://www.cnblogs.com/gsz-/p/9384448.html
Copyright © 2020-2023  润新知