solves image smoother

Author: anishLearnsToCode

Diff for: README.md

@@ -170,7 +170,7 @@
 | 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [![Java](assets/java.png)](src/SetMismatch.java) [![Python](assets/python.png)](python/set_mismatch.py) |
 | 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [![Java](assets/java.png)](src/TwoSumIVInputIsABST.java) [![Python](assets/python.png)](python/two_sum_iv.py) |
 | 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [![Java](assets/java.png)](src/RobotReturnToOrigin.java) [![Python](assets/python.png)](python/robot_return_to_origin.py) |
-| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | |
+| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [![Java](assets/java.png)](src/ImageSmoother.java) [![Python](assets/python.png)](python/image_smoother.py) |
 | 665 | [Non Deceasing Array](https://leetcode.com/problems/non-decreasing-array) | |
 | 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | |
 | 671 | [Second Minimum Node in Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | |

Diff for: python/image_smoother.py

@@ -0,0 +1,16 @@
+from typing import List
+
+
+class Solution:
+    def imageSmoother(self, img: List[List[int]]) -> List[List[int]]:
+        rows, columns = len(img), len(img[0])
+        result = [[0 for i in range(columns)] for j in range(rows)]
+        for row in range(rows):
+            for column in range(columns):
+                k_sum, count = 0, 0
+                for k_row in range(row if row == 0 else row - 1, (row if row == rows - 1 else row + 1) + 1):
+                    for k_column in range(column if column == 0 else column - 1, (column if column == columns - 1 else column + 1) + 1):
+                        k_sum += img[k_row][k_column]
+                        count += 1
+                result[row][column] = k_sum // count
+        return result

Diff for: src/ImageSmoother.java

@@ -0,0 +1,18 @@
+public class ImageSmoother {
+    public int[][] imageSmoother(int[][] img) {
+        int[][] result = new int[img.length][img[0].length];
+        int sum, count, rows = img.length, columns = img[0].length;
+        for (int row = 0 ; row < rows; row++) {
+            for (int column = 0 ; column < columns ; column++) {
+                sum = count = 0;
+                for (int k_row = row == 0 ? row : row - 1 ; k_row <= (row == rows - 1 ? row : row + 1) ; k_row++) {
+                    for (int k_column = column == 0 ? column : column - 1 ; k_column <= (column == columns - 1 ? column : column + 1) ; k_column++, count++) {
+                        sum += img[k_row][k_column];
+                    }
+                }
+                result[row][column] = sum / count;
+            }
+        }
+        return result;
+    }
+}