zoukankan      html  css  js  c++  java
  • 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 };
  • 相关阅读:
    zookeeper安装和使用
    一个最简单的Dubbo入门框架
    Dubbo Admin管理平台搭建
    Docker容器入门实践
    vue 项目安装 (入门)
    测试任何对象的某个特性是否存在 兼容js
    用户代理字符串检测呈现引擎、平台、Windows操作系统、移动设备和游戏系统 js
    React
    React (4) -- Conditional Rendering
    React (5) -- Lists and Keys
  • 原文地址:https://www.cnblogs.com/gsz-/p/9384448.html
Copyright © 2011-2022 走看看