832.Flipping an Image

最新推荐文章于 2024-09-18 11:04:20 发布
最新推荐文章于 2024-09-18 11:04:20 发布
阅读量192 收藏
点赞数
分类专栏： LeetCode 文章标签： Flipping an Image 832 leetcode c++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/dangwei_90/article/details/102212848
版权 
class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
        vector<vector<int>> finalImage;
        finalImage = A;
        if(1)
        {
            for(int n = 0; n < A.size(); n++)
            {
                for(int m = 0; m < A[n].size(); m++)
                {
                    finalImage[n][m] = A[n][(A[n].size() - m - 1)];
                    if(1 == finalImage[n][m])
                    {
                        finalImage[n][m] = 0;
                    }
                    else
                    {
                        finalImage[n][m] = 1;
                    }
                }
            }
        }
        else
        {
            
        }
        
        return finalImage;
    }
};

 

就是那个党伟
关注
专栏目录
LeetCode --- 832. Flipping an Image 解题报告
杨鑫newlife的专栏
08-18 250
Given a binary matrixA, 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]...
LeetCode - 832 - 翻转图像（flipping-an-image）
weixin_41806099的博客
01-18 239
一 目录 不折腾的前端，和咸鱼有什么区别目录一 目录二 前言三 解题及测试四 LeetCode Submit五 解题思路六 进一步思考二 前言 难度：简单涉及知识：数组题目地址：http...
[leetcode] 832. Flipping an Image
jing16337305的博客
05-16 640
题目：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 exam...
832. Flipping an Image
博客
05-14 726
/*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 examp...
Leetcode:832. Flipping an Image
Felaim的博客
05-25 892
问题描述：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 ...
Leetcode刷题9-832.翻转图像(C++)
qq_40858438的博客
03-02 365
题目来源：链接: [https://leetcode-cn.com/problems/flipping-an-image/submissions/]. 832.翻转图像1.问题描述2.解决方案3.代码 1.问题描述 给定一个二进制矩阵 A，我们想先水平翻转图像，然后反转图像并返回结果。 水平翻转图片就是将图片的每一行都进行翻转，即逆序。例如，水平翻转 [1, 1, 0] 的结果是 [0, 1, 1...
832.翻转图像Java
qq_35253136的博客
04-02 122
832.翻转图像Java 题目描述 给定一个二进制矩阵 A，我们想先水平翻转图像，然后反转图像并返回结果。 水平翻转图片就是将图片的每一行都进行翻转，即逆序。例如，水平翻转 [1, 1, 0] 的结果是 [0, 1, 1]。 反转图片的意思是图片中的 0 全部被 1 替换，1 全部被 0 替换。例如，反转 [0, 1, 1] 的结果是 [1, 0, 0]。 输入输出样式 示例1： 输入：[[1,1,0],[1,0,1],[0,0,0]] 输出：[[1,0,0],[0,1,0],[1,1,1]] 解释：首先翻
leetcode伪代码-flip-an-image:翻转图像
06-30
image. To flip an image horizo​​ntally means that each row of the image is reversed. For example, flipping [1, 1, 0] horizo​​ntally results in [0, 1, 1]. To invert an image means that each 0 is ...
leetcode 832. Flipping an Image（图像翻转）
蓝羽飞鸟的博客
01-10 153
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].
LeetCode——832. 翻转图像(Flipping an Image)[简单]——分析及代码（Java）
江南土豆的博客
03-01 147
LeetCode——832. 翻转图像[Flipping an Image][简单]——分析及代码[Java]一、题目二、分析及代码1. 双指针模拟（1）思路（2）代码（3）结果三、其他 一、题目 给定一个二进制矩阵 A，我们想先水平翻转图像，然后反转图像并返回结果。 水平翻转图片就是将图片的每一行都进行翻转，即逆序。例如，水平翻转 [1, 1, 0] 的结果是 [0, 1, 1]。 反转图片的意思是图片中的 0 全部被 1 替
LeetCode-Java-832. Flipping an Image
咸鱼塘
07-14 658
题目 Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image. 给定二进制矩阵A，我们想要水平翻转图像，然后反转它，并返回结果图像。 To flip an image horizontally means that each ...
C语言/832.（翻转图像）Flipping an Image
qq_38959715的博客
07-01 1208
先上题目思路，暴力做法，循环头尾逐个移动到中间，同时进行交换。#include &lt;stdio.h&gt; #include &lt;string.h&gt; int main(){     int i,j,AIlen,AJlen,temp,Jtemp;     int A[5][5]={{1,0,0,1,0},{1,0,1,1,0},{1,1,1,1,0},{1,0,1,1,1},{0,0...
【LeetCode】832. Flipping an Image 解题报告（Python）
负雪明烛
05-27 2624
【LeetCode】832. Flipping an Image 解题报告（Python） 标签（空格分隔）： LeetCode 题目地址：https://leetcode.com/problems/flipping-an-image/description/ 题目描述： Given a binary matrix A, we want to flip the image hori...
832.Flipping an Image（翻转图像）
漫漫编程路
05-14 1775
题目 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 e...
C++速通LeetCode中等第3题-盛最多水的容器
最新发布
lyx的博客
09-18 315
双指针法：两个指针分别指向左右边界，记录最大面积，由于面积由短板决定，两个指针中较短的短指针向内移动一格，再次记录最大面积，直到两指针相遇，得出答案。
Create a function pixel_flip(lst, orig_lst, budget, results, i=0) that uses recursion to generate all possible new unique images from the input orig_lst, following these rules: • The input lst is the current list being processed. Initially, this will be the same as orig_lst which is the original flattened image. • The input budget represents the number of pixels that can still be flipped. When the budget reaches 0, no more pixels can be flipped. • The input results is a list of resulting flattened images with flipped pixels. Initially, this will be an empty list. • The input i represents the index of the pixel being processed, by default set to 0, which is used to drive the recursive function towards its base case (i.e., initially starting from i=0). At termination of the function, the argument results should contain all possibilities of the input orig_lst by only flipping pixels from 0 to 1 under both the budget and the adjacency constraints. fill code at #TODO def pixel_flip(lst: list[int], orig_lst: list[int], budget: int, results: list, i: int = 0) -> None: """ Uses recursion to generate all possibilities of flipped arrays where a pixel was a 0 and there was an adjacent pixel with the value of 1. :param lst: 1D list of integers representing a flattened image . :param orig_lst: 1D list of integers representing the original flattened image. :param budget: Integer representing the number of pixels that can be flipped . :param results: List of 1D lists of integers representing all possibilities of flipped arrays， initially empty. :param i: Integer representing the index of the pixel in question. :return: None. """ #TODO def check_adjacent_for_one(flat_image: list[int], flat_pixel: int) -> bool: """ Checks if a pixel has an adjacent pixel with the value of 1. :param flat_image: 1D list of integers representing a flattened image . :param flat_pixel: Integer representing the index of the pixel in question. :return: Boolean. """ #TODO
05-25
Here's the code for the pixel_flip function and check_adjacent_for_one helper function: ``` def pixel_flip(lst: list[int], orig_lst: list[int], budget: int, results: list, i: int = 0) -> None: """ Uses recursion to generate all possibilities of flipped arrays where a pixel was a 0 and there was an adjacent pixel with the value of 1. :param lst: 1D list of integers representing a flattened image. :param orig_lst: 1D list of integers representing the original flattened image. :param budget: Integer representing the number of pixels that can be flipped. :param results: List of 1D lists of integers representing all possibilities of flipped arrays， initially empty. :param i: Integer representing the index of the pixel in question. :return: None. """ if budget == 0: # Base case: no more pixels can be flipped results.append(lst) return if i >= len(lst): # Base case: all pixels have been checked return if lst[i] == 0 and check_adjacent_for_one(orig_lst, i): # Flip the current pixel and recurse with a lower budget new_lst = lst.copy() new_lst[i] = 1 pixel_flip(new_lst, orig_lst, budget - 1, results, i + 1) # Recurse without flipping the current pixel pixel_flip(lst, orig_lst, budget, results, i + 1) def check_adjacent_for_one(flat_image: list[int], flat_pixel: int) -> bool: """ Checks if a pixel has an adjacent pixel with the value of 1. :param flat_image: 1D list of integers representing a flattened image. :param flat_pixel: Integer representing the index of the pixel in question. :return: Boolean. """ row_size = int(len(flat_image)**0.5) row = flat_pixel // row_size col = flat_pixel % row_size if row > 0 and flat_image[(row-1)*row_size+col] == 1: return True if row < row_size-1 and flat_image[(row+1)*row_size+col] == 1: return True if col > 0 and flat_image[row*row_size+(col-1)] == 1: return True if col < row_size-1 and flat_image[row*row_size+(col+1)] == 1: return True return False ``` The pixel_flip function takes in the current list being processed, orig_lst which is the original flattened image, budget representing the number of pixels that can still be flipped, results which is initially an empty list of resulting flattened images with flipped pixels, and i representing the index of the pixel being processed. The function uses recursion to generate all possibilities of flipped arrays where a pixel was a 0 and there was an adjacent pixel with the value of 1. It first checks if the budget is 0 or if all pixels have been checked, and returns accordingly. If the current pixel is 0 and has an adjacent pixel with the value of 1, it flips the current pixel and recurses with a lower budget. Otherwise, it recurses without flipping the current pixel. The check_adjacent_for_one helper function takes in the flattened image and the index of the pixel in question, and checks if the pixel has an adjacent pixel with the value of 1. It calculates the row and column of the pixel using integer division and modulus, and checks if the adjacent pixels in the vertical and horizontal directions have the value of 1. If any of the adjacent pixels have the value of 1, it returns True, otherwise it returns False.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值