Last night you partied a little too hard. Now there's a black and white photo of you that's about to go viral! You can't let this ruin your reputation, so you want to apply the box blur algorithm to the photo to hide its content. The pixels in the input image are represented as integers. The algorithm distorts the input image in the following way: Every pixel x in the output image has a value equal to the average value of the pixel values from the 3 × 3 square that has its center at x, including x itself. All the pixels on the border of x are then removed. Return the blurred image as an integer, with the fractions rounded down. Example For image = [[1, 1, 1], [1, 7, 1], [1, 1, 1]] the output should be boxBlur(image) = [[1]]. To get the value of the middle pixel in the input 3 × 3 square: (1 + 1 + 1 + 1 + 7 + 1 + 1 + 1 + 1) = 15 / 9 = 1.66666 = 1. The border pixels are cropped from the final result. For image = [[7, 4, 0, 1], [5, 6, 2, 2], [6, 10, 7, 8], [1, 4, 2, 0]] the output should be boxBlur(image) = [[5, 4], [4, 4]] There are four 3 × 3 squares in the input image, so there should be four integers in the blurred output. To get the first value: (7 + 4 + 0 + 5 + 6 + 2 + 6 + 10 + 7) = 47 / 9 = 5.2222 = 5. The other three integers are obtained the same way, then the surrounding integers are cropped from the final result. |
code >>
std::vector<std::vector<int>> boxBlur(std::vector<std::vector<int>> image) {
std::vector<std::vector<int>> v;
int sum = 0;
int x = image[0].size() - 2, y = image.size() - 2;
for (int i = 0; i < y; i++)
{
std::vector<int> t;
for (int j = 0; j < x; j++)
{
sum = 0;
for (int k = 0; k < 3; k++)
{
sum += image[k + i][0 + j] + image[k + i][1 + j] + image[k + i][2 + j];
}
sum = sum / 9;
t.push_back(sum);
}
v.push_back(t);
}
return v;
}
vector<vector<int>> a(image.size() - 2, vector<int>(image[0].size() - 2)); 이렇게 하면 미리 할당하고 시작할 수 있다.
'알고리즘 > codefights' 카테고리의 다른 글
25>arrayReplace (0) | 2017.07.06 |
---|---|
24>minesweeper (0) | 2017.07.06 |
22>avoidObstacles (0) | 2017.07.05 |
21>isIPv4Address (0) | 2017.07.04 |
20>arrayMaximalAdjacentDifference (0) | 2017.07.04 |