2.8 (C++)

Design a class Matrix that has the following private member variables:
int rows
int columns
double * values
Besides, it has the following public object functions:
A constructor Matrix(int rows, int column, double values[]), which initializes all elements in the matrix to the given values. Note that the given values are in one-dimensional, you need to fill then into the two-dimensional matrix correctly.
A copy constructor Matrix(const Matrix & matrix2).
A destructor.
A print function which prints each row of elements in a single line, with each element preceded with 4 spaces.
A function Matrix Matrix::transpose(), which returns a matrix that is the transpose of the default parameter (the invisible object parameter).
EXAMPLE INPUT
4 5
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
EXAMPLE OUTPUT

1    2    3    4    5
6    7    8    9    10
11    12    13    14    15
16    17    18    19    20

1    6    11    16
2    7    12    17
3    8    13    18
4    9    14    19
5    10    15    20

主程序 (不能修改)

#include "source.cpp"

Matrix read() {
    int rows;
    int columns;
    double values[1000];
    cin >> rows >> columns;
    for (int i = 0; i < rows * columns; ++ i) {
        cin >> values[i];
    }
    Matrix matrix(rows, columns, values);
    return matrix;
}

int main() {
    Matrix matrix = read(); // calls copy constructor
    matrix.print();
    cout << endl;
    
    matrix.transpose().print();
}

我的答案

#include <iostream>
using namespace std;


class Matrix{
private:    
    int rows;
    int columns;
    double *addr;
    
    void _init(int rows,int columns,double values[]){
        this->rows=rows;
        this->columns=columns;
        this->addr=new double[rows*columns];
        for (int i = 0; i < rows*columns ; ++ i) {
            this->addr[i]=(values==NULL ? 0: values[i]);
        }
    }
    
public:
    //构造函数1
    Matrix(int rows,int columns){
        this->_init(rows,columns,NULL);
    }
    //构造函数2
    Matrix(int rows,int columns,double values[]){
        this->_init(rows,columns,values);
    }
    //释构函数
    Matrix(const Matrix & m){
        this->_init(m.rows,m.columns,m.addr);
    }
    //=
    Matrix & operator = (const Matrix & m){
        delete [] this->addr;
        this->_init(m.rows,m.columns,m.addr);
        return *this;
    }
    //析构函数
    ~Matrix(){
        delete [] this->addr;
    }
    
    double get(int row, int col) const{
        int index = (row-1)* this->columns + (col-1);
        return this->addr[index];
    }
    
    void set(int row, int col,double val){
        int index = (row-1)* this->columns + col-1;
        this->addr[index] = val;
    }
    
    void print() const {
        for (int i = 0; i < this->rows; ++ i) {
            for (int j = 0; j < this->columns; ++ j) {
                cout << "    " << this->get(i+1,j+1);
            }
            cout<<endl;
        }
    }
    
    Matrix transpose(){
        Matrix m(this->columns,this->rows, NULL);
        for (int i = 0; i <this->columns; ++ i){
            for (int j = 0; j < this->rows; ++ j) {
                m.set(i+1,j+1,this->get(j+1,i+1));
            }
        }
        return m;
    }
    
};
上一篇: 2.9 (C++) 下一篇: 2.7 (C++)
支持 makedown语法

仅有一条评论

  1. yzb

    #include
    using namespace std;
    class Matrix
    {
    private:
    int rows;
    int columns;
    double * data;

    void _init(int rows, int columns, double values[]) {
    this->rows = rows;
    this->columns = columns;
    this->data = new double[rows * columns];
    for (int i = 0; i < rows * columns; ++ i)
    this->data[i] = (values == NULL ? 0 : values[i]);
    }
    int _index(int row, int column) const {
    return (row - 1) * this->columns + (column - 1);
    }
    public:
    Matrix(int rows, int columns) {
    this->_init(rows, columns, NULL);
    }
    Matrix(int rows, int columns, double values[]) {
    this->_init(rows, columns, values);
    }
    Matrix(const Matrix & matrix) {
    this->_init(matrix.rows, matrix.columns, matrix.data);
    }
    ~Matrix() {
    delete [] this->data;
    }
    void print() const {
    for (int i = 0; i < this->rows; ++ i) {
    for (int j = 0; j < this->columns; ++ j) {
    cout _index(row, column)] = value;
    }

    double get(int row, int column) const {
    return this->data[this->_index(row, column)];
    }
    Matrix transpose(){
    int p=rows;
    rows=columns;
    columns=p;
    Matrix m3( rows,columns,NULL );
    /* int count1=0;
    int a[100]={0};
    for (int i = 0; i < rows*columns; ++ i){
    a[i]=this->data[i];
    }*/
    int count2=0;
    for(int i=0;i

    yzb March 21st, 2021 at 08:39 pm回复