实验三

Vector_int.hpp

#ifndef VECTOR_INT_HPP
#define VECTOR_INT_HPP

#include<iostream>
#include<cassert>
using namespace std;

class Vector_int{
    public:
        Vector_int(int a);
        Vector_int(int a,int b);
        ~Vector_int();
        Vector_int(const Vector_int &v);
        void show() const;
        int &at(int a);
    private:
        int size;
        int *p;
};

Vector_int::Vector_int(int a):size(a){
    p=new int[size];
    for(auto i=0;i<size;++i) p[i]=0;
    cout<<"Default constructor called."<<endl;
}

Vector_int::Vector_int(int a,int b):size(a){
    p=new int[size];
    for(auto i=0;i<size;++i) p[i]=b;
    cout<<"Constructor called."<<endl;
}

Vector_int::~Vector_int(){
    delete [] p;
    cout<<"Destructor called."<<endl;
}

Vector_int::Vector_int(const Vector_int &v):size(v.size){
    p=new int[size];
    for(auto i=0;i<size;++i) p[i]=v.p[i];
    cout<<"Copy constructor called."<<endl;
}

int &Vector_int::at(int a){
    assert(a>=0&&a<size);
    return p[a];
}

void Vector_int::show() const{
    for(auto i=0;i<size;++i) cout<<p[i]<<" ";
    cout<<endl;
}

#endif

Vector_int.cpp

#include"Vector_int.hpp"
#include<iostream>
using namespace std;

int main(){
    int n;
    cin>>n;
    
    Vector_int x1(n);
    x1.show();
    
    Vector_int x2(n,5);
    x2.show();
    
    Vector_int y(x2);
    y.show();
    
    y.at(0)=8;
    y.show();
    
    return 0;
}

 

 

Matrix.hpp

#ifndef MATRIX_H
#define MATRIX_H

#include <iostream>
#include <cassert>

class Matrix
{
public:
    Matrix(int n);                     // 构造函数，构造一个n*n的矩阵
    Matrix(int n, int m);              // 构造函数，构造一个n*m的矩阵
    Matrix(const Matrix &X);           // 复制构造函数，使用已有的矩阵X构造
    ~Matrix();                         //析构函数
    void set(const double *pvalue);     // 用pvalue指向的连续内存块数据为矩阵赋值
    void set(int i, int j, int value); //设置矩阵第i行第j列元素值为value
    double &at(int i, int j);          //返回矩阵第i行第j列元素的引用
    double at(int i, int j) const;     // 返回矩阵第i行第j列元素的值
    int get_lines() const;             //返回矩阵行数
    int get_cols() const;              //返回矩列数
    void print() const;                // 按行打印输出矩阵
private:
    int lines; // 矩阵行数
    int cols;  // 矩阵列数
    double *p; // 指向存放矩阵数据的内存块的首地址
};

Matrix::Matrix(int n):lines(n),cols(n){
    p=new double[n*n];
}

Matrix::Matrix(int n,int m):lines(n),cols(m){
    p=new double[n*m];
}

Matrix::Matrix(const Matrix &X):lines(X.lines),cols(X.cols){
    p=new double[lines*cols];
    for(auto i=0;i<lines*cols;++i) p[i]=X.p[i];
}

Matrix::~Matrix(){
    delete [] p;
}

void Matrix::set(const double *pvalue){
    for(auto i=0;i<lines*cols;++i) p[i]=pvalue[i];
}

void Matrix::set(int i,int j,int value){
    assert(i>=0&&i<lines&&j>=0&&j<cols);
    p[i*cols+j]=value;
}

double& Matrix::at(int i,int j){
    assert(i>=0&&i<lines&&j>=0&&j<cols);
    return p[i*cols+j];
}

double Matrix::at(int i,int j) const{
    assert(i>=0&&i<lines&&j>=0&&j<cols);
    return p[i*cols+j];
}

int Matrix::get_lines() const{
    return lines;
}

int Matrix::get_cols() const{
    return cols;
}

void Matrix::print() const{
    for(auto i=0;i<lines;++i){
        for(auto j=0;j<cols;++j){
            std::cout<<p[i*cols+j]<<",";
        }
        std::cout<<"\b "<<std::endl;
    }
    std::cout<<std::endl;
}

#endif

task5.cpp

#include <iostream>
#include "matrix.hpp"

int main()
{
    using namespace std;

    double x[] = {6, 5, 4, 3, 2, 1};

    Matrix m1(2, 3);
    m1.set(x);
    m1.print();
    cout << "the first line is: " << endl;
    cout << m1.at(0, 0) << " " << m1.at(0, 1) << " " << m1.at(0, 2)<< endl;
    cout << endl;

    Matrix m2(3, 2);
    m2.set(x);
    m2.print();
    cout << "the first line is: " << endl;
    cout << m2.at(0, 0) << " " << m2.at(0, 1) << endl;
    cout << endl;

    Matrix m3(m2);
    m3.set(0, 0, 999);
    m3.print();
}