Java - 计算整数在矩阵中出现的次数

Question

我需要找到一个整数出现在矩阵中的次数,无论我做什么,我得到的结果总是"0".最有可能的答案很简单,但我找不到它,我会很感激一些帮助.:)

这是我的代码:

    int m, n, c, d, nr = 0, x;
    Scanner in = new Scanner(System.in);

    System.out.println("Enter the number of rows:");
    m = in.nextInt();
    System.out.println("Enter the number of columns:");
    n  = in.nextInt();

    int matrix[][] = new int[m][n];

    System.out.println("Enter the elements of the matrix:");

    for (  c = 0 ; c < m ; c++ )
        for ( d = 0 ; d < n ; d++ )
            matrix[c][d] = in.nextInt();

    System.out.println("Enter the value for number x:");
    x = in.nextInt();

    for (  c = 0 ; c < m ; c++ ) {
        if(c == x)
            nr++;
    }

    for ( d = 0 ; d < n ; d++ ) {
        if(d == x)
            nr++;
    }

    System.out.println("Number x appears " + nr + " times.");`

PS我是Java的新手.

Answer 1

你没有比较你matrice的x.

您正在x与索引进行比较.

而是试试这个:

for (  c = 0 ; c < m ; c++ ) {
    for(d = 0; d < n; d++) {
        if(x == matrice[c][d]) {
            nr++;
        }
    }
}
System.out.println("Number x appears " + nr + " times.");`