| #include <iostream> |
| using namespace std; |
| class vector_N |
| { |
| private: |
| int n; |
| int *p; |
| public: |
| vector_N () |
| { |
| n = 0; |
| p = nullptr; |
| } |
| explicit vector_N (int dim) |
| { |
| n = dim; |
| p = new int[n]; |
| } |
| vector_N (const vector_N& v) |
| { |
| n = v.n; |
| p = new int[v.n]; |
| for (int i = 0; i < n; i++) |
| { |
| p[i] = v.p[i]; |
| } |
| } |
| vector_N& operator = (const vector_N& v) |
| { |
| if (this != &v) |
| { |
| n = v.n; |
| p = new int[v.n]; |
| for (int i = 0; i < n; i++) |
| { |
| p[i] = v.p[i]; |
| } |
| } |
| return *this; |
| } |
| friend istream& operator >> (istream& is,vector_N& v) |
| { |
| is >> v.n; |
| if (v.n <= 0) |
| { |
| cout << "Error Length!\n"; |
| exit(0); |
| } |
| v.p = new int[v.n]; |
| for (int i = 0; i < v.n; i++) |
| { |
| is >> v.p[i]; |
| } |
| return is; |
| } |
| friend ostream& operator << (ostream& os,vector_N& v) |
| { |
| for (int i = 0; i < v.n; i++) |
| { |
| os << v.p[i] << " "; |
| } |
| return os; |
| } |
| vector_N operator + (const vector_N& v) |
| { |
| if (n != v.n) |
| { |
| cout << "Mismatch Length!\n" ; |
| exit(0); |
| } |
| vector_N res(n); |
| for (int i = 0; i < n; i++) |
| { |
| res.p[i] = p[i] + v.p[i]; |
| } |
| return res; |
| } |
| vector_N operator - (const vector_N& v) |
| { |
| if (n != v.n) |
| { |
| cout << "Mismatch Length!\n" ; |
| exit(0); |
| } |
| vector_N res(n); |
| for (int i = 0; i < n; ++i) |
| { |
| res.p[i] = p[i] - v.p[i]; |
| } |
| return res; |
| } |
| vector_N operator * (int x) |
| { |
| vector_N res(n); |
| for (int i = 0; i < n; ++i) |
| { |
| res.p[i] = p[i] * x; |
| } |
| return res; |
| } |
| int operator * (const vector_N& v) |
| { |
| if (n != v.n) |
| { |
| cout << "Mismatch Length!\n" ; |
| exit(0); |
| } |
| int res = 0; |
| for (int i = 0; i < n; i++) |
| { |
| res += p[i] * v.p[i]; |
| } |
| return res; |
| } |
| int operator [] (int x) |
| { |
| if (x < 0 || x > n) |
| { |
| cout << "Error Index\n"; |
| exit(0); |
| } |
| return p[x]; |
| } |
| ~vector_N() |
| { |
| delete p; |
| n = 0; |
| } |
| }; |
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 使用C#创建一个MCP客户端
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 按钮权限的设计及实现