class Solution {
public:
vector<vector<int>> flipAndInvertImage(vector<vector<int>>& image) {
int n = image.size();
for(int i = 0;i < n;i++)
{
int left = 0,right = n-1;
while(left < right)
{
if(image[i][left] == image[i][right])
{
image[i][left] ^= 1;
image[i][right] ^= 1;
}
left++;
right--;
}
if(left == right)
{
image[i][left] ^= 1;
}
}
return image;
}
};
leetcode每日一题第122天
最新推荐文章于 2024-07-20 22:34:59 发布