In this post we will attempt to solve LeetCode 832. Flipping an Image in Java.
Given an n x n binary matrix image, 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]. Constraints: o n == image.length o n == image[i].length o 1 <= n <= 20 o images[i][j] is either 0 or 1. Related Topivs: o Array o Two Pointers o Matrix o Simulation
We are given a matrix of 0s and 1s and are asked to flip and then invert some of the values. Continue reading “LeetCode 832. Flipping an Image in Java”