我已經在 java 中實現了一個卷積過濾器。我在 ap cs 中做過一段時間，但現在我確實需要它來做某事，所以我重新實現了它以確保我仍然知道如何去做。不幸的是，我丟失了我的工作副本，所以我無法將當前代碼與我以前的工作代碼進行比較。我很確定我正確地實現了算法，但代碼仍然無法正常工作。有經驗的程序員能解釋一下我做錯了什么嗎？這是卷積類：import java.awt.*;import java.util.Arrays;public class ConvolutionFilter {    private int[][] image;    private int[][] weights;    private double[][] doubleWeights;    private int[][] convolved;    public ConvolutionFilter(int[][] image, int[][] weights) {        this.image = image;        this.weights = weights;        convolve();    }    public void convolve() {        int sum;        int[][] convolved = new int[image.length][image[0].length];        for (int r = 0; r < convolved.length - weights.length - 1; r++) {            for (int c = 0; c < convolved[r].length - weights.length - 1; c++) {                sum = 0;                for (int i = 0; i < weights.length; i++) {                    for (int j = 0; j < weights[i].length; j++) {                        sum += image[r + i][c + j] * weights[i][j];                    }                }                convolved[r][c] = sum / weight();            }        }        this.convolved = convolved;    }    public int numWeights() {        return weights.length * weights[0].length;    }    public int weight() {        int sum = 0;        for (int r = 0; r < weights.length; r++) {            for (int c = 0; c < weights[r].length; c++) {                sum += weights[r][c];            }        }        if (sum == 0) return 1; else return sum;    }    public int[][] getConvolved() {        return convolved;    }}任何幫助表示贊賞！