Leetcode 3033. Modify the Matrix

Given an m x n matrix, return a new matrix where each entry equal to -1 is replaced by the maximum value found in its column (each column is guaranteed to contain at least one non-negative).