打印 N 阶下赫森伯格矩阵
原文:https://www . geesforgeks . org/print-lower-hessenberg-matrix-of-order-n/
给定一个正整数 N ，任务是打印顺序为 N 的下赫森伯格矩阵，该矩阵包含任意一位随机正整数作为非零元素。 下赫森伯格矩阵是一个正方形矩阵，其中超对角线之上的所有元素都为零。在数学术语中，所有 j > i + 1 的 mat[i][j] = 0。 举例:
输入: N = 3 输出: 1 2 0 1 3 4 2 3 4 输入: N = 4 输出: 1 2 0 1 3 4 0 2 3 4 2 2 3 1 4
方法:对于打印具有一位数正元素的下赫森伯格矩阵，在兰德()函数的帮助下，为矩阵中的所有单元格打印零，其中 j > i + 1 和任何一位数随机数。 以下是上述方法的实现:
C++
// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
// Function to print the Lower Hessenberg
// matrix of order n
void LowerHessenbergMatrix(int n)
{
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
// If element is above super-diagonal
// then print 0
if (j > i + 1)
cout << '0' << " ";
// Print a random digit for
// every non-zero element
else
cout << rand() % 10 << " ";
}
cout << "\n";
}
}
// Driver code
int main()
{
int n = 4;
LowerHessenbergMatrix(n);
return 0;
}
Java 语言(一种计算机语言，尤用于创建网站)
// Java implementation of the approach
class GFG
{
// Function to print the Lower Hessenberg
// matrix of order n
static void LowerHessenbergMatrix(int n)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
// If element is above super-diagonal
// then print 0
if (j > i + 1)
System.out.print('0' + " ");
// Print a random digit for
// every non-zero element
else
{
System.out.printf("%.0f",Math.random() * 10);
System.out.print(" ");
}
}
System.out.println("\n");
}
}
// Driver code
public static void main(String[] args)
{
int n = 4;
LowerHessenbergMatrix(n);
}
}
/* This code is contributed by PrinciRaj1992 */
Python 3
# Python3 implementation of the approach
import random
# Function to print the Upper Hessenberg
# matrix of order n
def UpperHessenbergMatrix(n):
for i in range(1, n + 1):
for j in range(1, n + 1):
# If element is below sub-diagonal
# then pr0
if (j > i + 1):
print('0', end = " ")
# Pra random digit for
# every non-zero element
else:
print(random.randint(1, 10),
end = " ")
print()
# Driver code
n = 4;
UpperHessenbergMatrix(n)
# This code is contributed by Mohit Kumar
C
// C# implementation of the approach
using System;
class GFG
{
// Function to print the Lower Hessenberg
// matrix of order n
static void LowerHessenbergMatrix(int n)
{
Random rand = new Random();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
// If element is above super-diagonal
// then print 0
if (j > i + 1)
Console.Write(0 + " ");
// Print a random digit for
// every non-zero element
else
Console.Write(rand.Next(1, 10) + " ");
}
Console.WriteLine();
}
}
// Driver code
static public void Main ()
{
int n = 4;
LowerHessenbergMatrix(n);
}
}
// This code is contributed by AnkitRai01
java 描述语言
<script>
// Javascript implementation of the approach
// Function to print the Lower Hessenberg
// matrix of order n
function LowerHessenbergMatrix(n)
{
for (var i = 1; i <= n; i++) {
for (var j = 1; j <= n; j++) {
// If element is above super-diagonal
// then print 0
if (j > i + 1)
document.write( '0' + " ");
// Print a random digit for
// every non-zero element
else
document.write(Math.floor(Math.random() * 10) + " ");
}
document.write( "<br>");
}
}
// Driver code
var n = 4;
LowerHessenbergMatrix(n);
</script>
Output:
3 6 0 0
7 5 3 0
5 6 2 9
1 2 7 0
版权属于：月萌API www.moonapi.com，转载请注明出处
