보통 0명 해결 정답률 0%

Box Blur

Blur a grayscale image by replacing each pixel with the rounded average of its 3 by 3 neighborhood.

배우게 될 내용

  • Visit the 3 by 3 neighbors of a grid cell
  • Skip neighbors outside the grid
  • Write results to a new grid so originals are not overwritten

문제

번역본 보기

A box blur softens an image by replacing every pixel with the average of itself and its neighbors. Here the image is a grid of brightness values from 0 to 255. For each pixel, take the 3 by 3 block centered on it and average the pixels of that block that lie inside the image: 9 pixels in the middle, 6 along an edge, 4 in a corner (fewer for images only 1 row or column wide). Always average the original values, never values you have already blurred.

Round the average to the nearest whole number with halves rounded up. With integers only, for a block with sum s and count c that is (2 × s + c) / (2 × c) with integer division.

Implement box_blur(pixels).

Input

pixels: The image, one list per row. All rows have the same length.

Output

Return the blurred image as a grid of the same size. An empty image gives an empty grid.

제약 조건

0 ≤ rows ≤ 50, 1 ≤ pixels per row ≤ 50 when there is at least one row

0 ≤ each pixel ≤ 255

예시

예시 1
입력:
pixels = [
    [10, 20, 30],
    [40, 50, 60],
    [70, 80, 90]
]

예상 출력:
expected = [
    [30, 35, 40],
    [45, 50, 55],
    [60, 65, 70]
]
입력:
std::vector<std::vector<long long>> pixels = {
    {10, 20, 30},
    {40, 50, 60},
    {70, 80, 90}
};

예상 출력:
std::vector<std::vector<long long>> expected = {
    {30, 35, 40},
    {45, 50, 55},
    {60, 65, 70}
};
입력:
long[][] pixels = new long[][] {
    new long[] {10, 20, 30},
    new long[] {40, 50, 60},
    new long[] {70, 80, 90}
};

예상 출력:
long[][] expected = new long[][] {
    new long[] {30, 35, 40},
    new long[] {45, 50, 55},
    new long[] {60, 65, 70}
};

설명

The corner 10 averages 10, 20, 40, 50 to 30. The center averages all nine values to 50. The top middle averages 10, 20, 30, 40, 50, 60 to 35.

예시 2
입력:
pixels = [
    [0, 255]
]

예상 출력:
expected = [
    [128, 128]
]
입력:
std::vector<std::vector<long long>> pixels = {
    {0, 255}
};

예상 출력:
std::vector<std::vector<long long>> expected = {
    {128, 128}
};
입력:
long[][] pixels = new long[][] {
    new long[] {0, 255}
};

예상 출력:
long[][] expected = new long[][] {
    new long[] {128, 128}
};

설명

Each pixel's block holds both pixels, and (0 + 255) / 2 = 127.5 rounds up to 128, so [[128, 128]].

접근 방법

먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.

힌트 1

Loop over row and column offsets from −1 to 1 around each pixel.

힌트 2

Count how many neighbors are inside the grid, because edges and corners have fewer.

힌트 3

Read from the original grid and write to a separate result grid.

예상 복잡도

O(rows × columns) time, O(rows × columns) extra space

참고 자료

이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.

코더마다 가장 좋은 통과 풀이입니다. 더 빠르고, 메모리를 덜 쓰고, 평가가 좋은 풀이가 위에 옵니다.

아직 통과한 풀이가 없습니다. 풀어서 1위를 차지하세요.

다른 사람의 풀이 보기

커뮤니티 솔루션

아직 공개된 풀이가 없습니다. 문제를 풀고 첫 풀이를 공유하세요.