实验4

实验任务5

vectorlnt.hpp

#pragma once
#include<iostream>
#include<cassert>
using std::cout;

class vectorInt 
{
public:
    vectorInt(int n);
    vectorInt(int n, int v);
    vectorInt(vectorInt& vp);
    ~vectorInt();
    
    int& at(int i);
    int get_size() 
    { 
        return size; 
    }
private:
    int size;
    int* p;
    friend void output(vectorInt& x);
};

vectorInt::vectorInt(int a) :size{ a } 
{
    cout << "constructor 1 called."<< endl;
    p = new int[size];
}

vectorInt::~vectorInt() 
{
    cout << "destructor called."<< endl;
    delete[]p;
}
int &vectorInt::at(int x) 
{
    assert(x >= 0 && x < size);
    return p[x];
}

vectorInt::vectorInt(int n, int m): size { n }
{
    cout << "constructor 2 called."<< endl;
    p = new int[size];
    for (auto i = 0; i < size; i++)
    {
        p[i] = m;
    }
}

vectorInt::vectorInt(vectorInt& op) :size{ op.size } 
{
    cout << "copy constructor called,"<< endl;
    p = new int[size];
    for (auto i = 0; i < size; i++)
    {
        p[i] = op.p[i];
    }
}

void output(vectorInt &x)
{
    for(auto i=0;i<x.size-1;++i)
    {
        cout << x.at(i) << ", ";
    }
    cout << x.at(x.size-1) << endl;
}

 

task5.cpp

#include <iostream>
#include"vectorInt.hpp"
void test() {
    using namespace std;
    int n;
    cin >> n;
    vectorInt x1(n);
    for (auto i = 0; i < n; ++i)
        x1.at(i) = i * i;
    output(x1);
    vectorInt x2(n, 44);
    vectorInt x3(x2);
    output(x2);
    output(x3);
    x2.at(0) = 88;
    output(x2);
    output(x3);
}
int main() {
    test();
}

 

测试截图

 

实验任务6

Martrix.hpp

#pragma once

#include <iostream>

using std::cout;
using std::endl;

class Matrix {
    public:
        Matrix(int n);//构造函数,构造一个n*n的矩阵 
        Matrix(int n, int m);//构造函数,构造一个n*m的矩阵 
        Matrix(const Matrix &X);//复制构造函数,使用已有的矩阵X构造 
        ~Matrix() = default;//构析函数 
        
        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();//按行打印输出矩阵 
        
    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];
    }
    
} 

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) 
{
    p[i * cols+j] = value;
}

double &Matrix::at(int i, int j) 
{
    return p[i * cols+j];
}

double Matrix::at(int i, int j) const 
{
    return p[i * cols+j];
} 

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

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

void Matrix::print() const
{
    int a,b;
    for ( a = 0; a < lines; a++)
    {
        for ( b = 0; b < cols-1; b++)
        {
            cout<<p[a*cols+b]<<", ";
        }
        cout<<p[a*cols+b]<<endl;
    }   
}

task6.cpp

 

#include <iostream>
#include "实验四task6_Matrix.hpp"

void test() {
    using namespace std; 
    
    double x[] = {11, 22, 33, 44, 55, 66};
    
    Matrix m1(3, 2);//创建一个3×2的矩阵
    m1.set(x);//用一维数组x的值按行为矩阵m1赋值 
    m1.print(); // 打印矩阵m1的值
    cout << "the first line is: " << endl;
    cout << m1.at(0, 0) << " " << m1.at(0, 1) << endl;//输出矩阵m1第1行两个元素的值
    cout << endl;
    
    Matrix  m2(2, 3);
    m2.set(x);
    m2.print();
    cout << "the first line is: " << endl;
    cout << m2.at(0, 0) << " " << m2.at(0, 1) << " " << m2.at(0, 2) << endl;
    cout << endl;
    
    Matrix m3(m2);//用矩阵m2构造新的矩阵m3
    m3.set(0, 0, 888);//将矩阵m3第0行第0列元素值设为999
    m3.print(); 
}
int main() {
    test();
}

测试截图

 

posted @ 2022-11-07 09:38  丁鑫铖  阅读(31)  评论(0)    收藏  举报