ARTICLE · INTELLIGENCE

战地情报 · 详情页

来自尧图项目组的一线实战观察与深度解析

【leetcode】Leetcode:832. Flipping an Image

【leetcode】Leetcode: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:

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

先对行进行逆序,然后相当于1变0,0变1.

class Solution { public: vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) { vector<vector<int> > image; for(int n=0; n<A.size(); n++) { vector<int> row; for(vector<int>::iterator it = A[n].end(); it != A[n].begin(); ) { if(*(--it)) row.push_back(0); else row.push_back(1); } image.push_back(row); } return image; } };

如果了解了算法的话,直接在逆序的时候进行转换就行了!O(∩_∩)O哈哈~

RELATED READING

延伸阅读

更多一线实战笔记与深度复盘,助您持续精进