实验三
#pragma once
#include<iostream>
class Vector_int
{
public:
Vector_int(int n);
Vector_int(int n, int m);
Vector_int(Vector_int& x);
int &at(int i);
void print()const;
~Vector_int();
private:
int* p;
int size;
};
Vector_int::Vector_int(int n):size{n}
{
p = new int[size]();
std::cout << "constructor called." << std::endl;
}
Vector_int::Vector_int(int n, int m):size{n}
{
p = new int[size]();
for (int i = 0;i < size;i++)
p[i] = m;
std::cout << "constructor called." << std::endl;
}
Vector_int::Vector_int(Vector_int& x)
{
size = x.size;
p = new int[x.size]();
for (int i = 0;i < x.size;i++)
p[i] = x.p[i];
std::cout << "constructor called." << std::endl;
}
int& Vector_int::at(int i)
{
return p[i];
}
void Vector_int::print()const
{
for (int i = 0;i <size;i++)
std::cout << p[i] << ' ';
std::cout << std::endl;
}
Vector_int::~Vector_int()
{
delete[] p;
std::cout << "configurator called." << std::endl;
}
task4.cpp
#include<iostream>
#include"Vector_int.hpp"
int main()
{
using namespace std;
int n=8;
cout << "n=" << n << endl;
Vector_int x1(n);
x1.print();
Vector_int x(n, 6);
x1.print();
Vector_int y(x);
y.at(0) = 999;
y.print();
}
运行截图

实验任务5
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[lines * cols]();
}
Matrix::Matrix(int m, int n) : lines{ m }, cols{ n }
{
p = new double[m * n]();
}
Matrix::Matrix(const Matrix& x) : lines{ x.lines }, cols{ x.cols }
{
p = new double[lines * cols];
for (int i = 0;i < lines * cols;i++)
p[i] = x.p[i];
}
Matrix::~Matrix()
{
delete[] p;
}
void Matrix::set(const double* pvalue)
{
for (int 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 j = 0;
for (int i = 0;i < lines * cols;i++)
{
if (j == cols)
{
std::cout << std::endl;
j = 0;
}
std::cout << p[i] <<' ';
j++;
}
std::cout << std::endl;
}
#endif
task5.cpp
#include <iostream>
#include "matrix.hpp"
int main()
{
using namespace std;
double x[] = { 1, 2, 3, 4, 5, 6 };
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;
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);
m3.set(0, 0, 999);
m3.print();
}
运行截图


posted on 2021-12-22 15:37 19物联网一班李大伟 阅读(32) 评论(0) 收藏 举报

浙公网安备 33010602011771号