| 8 | 8 | * @returns {string[]} |
| 9 | 9 | */ |
| 10 | 10 | export const annotate = (input) => { |
| 11 | | throw new Error('Remove this statement and implement this function'); |
| 11 | // Edge Case: Handle empty input array |
| 12 | if (!input || input.length === 0) { |
| 13 | return []; |
| 14 | } |
| 15 | |
| 16 | const rows = input.length; |
| 17 | const cols = input[0].length; |
| 18 | const result = []; |
| 19 | |
| 20 | // Edge Case: Handle rows with different lengths |
| 21 | for (let i = 0; i < rows; i++) { |
| 22 | if (input[i].length !== cols) { |
| 23 | throw new Error('All rows must have the same length'); |
| 24 | } |
| 25 | } |
| 26 | |
| 27 | // Directions for 8 adjacent cells (horizontal, vertical, diagonal) |
| 28 | const directions = [ |
| 29 | [-1, -1], [-1, 0], [-1, 1], |
| 30 | [0, -1], [0, 1], |
| 31 | [1, -1], [1, 0], [1, 1] |
| 32 | ]; |
| 33 | |
| 34 | // Process each cell |
| 35 | for (let i = 0; i < rows; i++) { |
| 36 | let newRow = ''; |
| 37 | for (let j = 0; j < cols; j++) { |
| 38 | // If current cell is a flower, keep it as is |
| 39 | if (input[i][j] === '*') { |
| 40 | newRow += '*'; |
| 41 | } else { |
| 42 | // Count adjacent flowers |
| 43 | let count = 0; |
| 44 | for (const [dx, dy] of directions) { |
| 45 | const ni = i + dx; |
| 46 | const nj = j + dy; |
| 47 | |
| 48 | // Edge Case: Check bounds to avoid accessing invalid indices |
| 49 | if (ni >= 0 && ni < rows && nj >= 0 && nj < cols) { |
| 50 | if (input[ni][nj] === '*') { |
| 51 | count++; |
| 52 | } |
| 53 | } |
| 54 | } |
| 55 | |
| 56 | // If no adjacent flowers, leave empty, otherwise put the count |
| 57 | newRow += count === 0 ? ' ' : count.toString(); |
| 58 | } |
| 59 | } |
| 60 | result.push(newRow); |
| 61 | } |
| 62 | |
| 63 | return result; |
| 12 | 64 | }; |
| 65 | |
| 66 | // Handled Edge Cases: Empty input array, rows with different lengths, accessing invalid indices |