[c++]二维矩阵存储及基本操作demo

C++实现二维矩阵存储及基本操作demo

/* 调试过程的低级错误:1.循环ij问题;2.指针未经初始化 */

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<stdlib.h>
#include<cstring>
using namespace std;

class Matrix {
public:
	int row_num;
	int col_num;
	double **p = NULL;
};

Matrix* sampleMatrix = new Matrix;

void matrixInitialization(Matrix* matrix, int row, int col) {
	matrix->row_num = row;
	matrix->col_num = col;
	matrix->p = new double*[matrix->row_num];
	for (int i = 0; i < matrix->row_num; i++) {
		matrix->p[i] = new double[matrix->col_num];
	}
}

void ZeroMatrix(Matrix* matrix) {
	for (int i = 0; i < matrix->row_num; i++) {
		for (int j = 0; j < matrix->col_num; j++) {
			matrix->p[i][j] = 0;
		}
	}
}

void ValueMatrix(Matrix* matrix, int value) {
	for (int i = 0; i < matrix->row_num; i++) {
		for (int j = 0; j < matrix->col_num; j++) {
			matrix->p[i][j] = value;
		}
	}
}

void matrixDelete(Matrix* matrix) {
	for (int i = 0; i < matrix->row_num; i++) {
		delete[] matrix->p[i];
	}
	delete[] matrix->p;
}

int main(){
    int rows = 100;
    int cols = 184;
    matrixInitialization(sampleMatrix, rows, cols);

    ValueMatrix(sampleMatrix, 6);
    for(int i=0;i<sampleMatrix->row_num;i++){
        for(int j=0;j<sampleMatrix->col_num;j++){
            cout<<sampleMatrix->p[i][j]<<" ";
        }
        cout<<endl;
    }
    delete sampleMatrix;
    return 0;
}

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值