C ++程序查找矩阵中每一行的最大元素

给定一个矩阵，任务是找到每一行的最大元素。
例子：

Input :  [1, 2, 3]
         [1, 4, 9]
         [76, 34, 21]

Output :
3
9
76

Input : [1, 2, 3, 21]
        [12, 1, 65, 9]
        [1, 56, 34, 2]
Output :
21
65
56

方法：方法很简单。这个想法是为 no_of_rows 运行循环。检查行内的每个元素并找到最大元素。最后，打印元素。下面是实现：

C++

// C++ program to find maximum 
// element of each row in a matrix
#include
using namespace std;
const int N = 4; 
  
  
    // Print array element
    void printArray(int result[], int no_of_rows) {
        for (int i = 0; i < no_of_rows; i++) {
            cout<< result[i]<<"
";
        }
  
    }
  
    // Function to get max element
    void maxelement(int no_of_rows, int arr[][N]) {
        int i = 0;
          
        // Initialize max to 0 at beginning
        // of finding max element of each row
        int max = 0;
        int result[no_of_rows];
        while (i < no_of_rows) {
            for (int j = 0; j < N; j++) {
                if (arr[i][j] > max) {
                    max = arr[i][j];
                }
            }
            result[i] = max;
            max = 0;
            i++;
  
        }
        printArray(result,no_of_rows);
  
    }
  
    // Driver code
    int main()
    {
        int arr[][N] = { {3, 4, 1, 8},
                        {1, 4, 9, 11},
                        {76, 34, 21, 1},
                        {2, 1, 4, 5} };
    // Calling the function 
        maxelement(4, arr);
    }
  
// This code is contributed by Rajput-Ji

输出 ：

8
11
76
5

有关详细信息，请参阅有关查找矩阵中每一行的最大元素的完整文章！