cs11_c++_lab4a
SparseVector.hh
- class SparseVector
- {
- private:
- //结构体不一定会用到,不用初始化
- struct node
- {
- int index;
- int value;
- node *next;
- node(int index, int value, node *next = ) : index(index), value(value), next(next) {}
- };
- //这些才是真正的数据成员,要初始化的
- int size;
- node *start;
- void clear();
- void copyList(const SparseVector &sv);
- void setNonzeroElem(int index, int value);
- void removeElem(int index);
- void checkListOrder();
- public:
- SparseVector(int size);
- const int getSize()const;
- ~SparseVector();
- SparseVector(const SparseVector &sv);
- SparseVector & operator= (const SparseVector &sv);
- int getElem(int idx);
- void setElem(int index, int value);
- };
SparseVector.cc
- #include "SparseVector.hh"
- #include <cassert>
- #include <iostream>
- using namespace std;
- //单参数构造函数
- SparseVector::SparseVector(int size):size(size)
- {
- start = ;
- }
- const int SparseVector::getSize()const
- {
- return size;
- }
- //成员函数都默认带有this指针,所以默认对调用这个函数的对象进行操作,所以不用再传本对象的地址了。
- void SparseVector::clear()
- {
- node *next;
- node *current;
- current = start;
- while(current != )
- {
- next = current->next;
- delete current;
- current = next;
- }
- start = ;
- }
- //对本对象进行操作,调用成员行数也是默认对本对象进行操作,不用传本对象地址。
- SparseVector::~SparseVector()
- {
- clear();
- }
- void SparseVector::copyList(const SparseVector &sv)
- {
- size = sv.getSize();
- node *current;
- node *otherCurrent =sv.start;
- node *prev = ;
- while(otherCurrent != )
- {
- current = new node(otherCurrent->index, otherCurrent->value);
- if(prev == )
- {
- start = current;
- prev = current;
- }
- prev->next = current;
- prev = current;
- otherCurrent = otherCurrent->next;
- }
- }
- SparseVector::SparseVector(const SparseVector &sv)
- {
- copyList(sv);
- }
- //注意自赋值,并且直接调用私有帮助函数。
- SparseVector & SparseVector:: operator= (const SparseVector &sv)
- {
- if (this == &sv)
- {
- return *this;
- }
- clear();
- copyList(sv);
- return *this;
- }
- //难点
- int SparseVector::getElem(int idx)
- {
- node *current = start;
- while(current != && current->index < idx)//过滤,两个条件
- {
- current = current->next;
- }
- if(current == )//注意判断条件先后次序,先排除current为0情况
- {
- return ;
- }
- else if(current->index == idx)//如果先执行这个,则current为0时,会直接产生段错误
- {
- return current->value;
- }
- else
- {
- return ;
- }
- }
- //难点,分种情况讨论:1,初始为空。2,插到最后面。3,插到最前面。4,插到中间。
- void SparseVector::setNonzeroElem(int index, int value)
- {
- assert(value != );
- node *current = start;
- node *prev = ;
- if(start == )//容易遗漏,链表初始为空的情况。(1)
- {
- start = new node(index, value);
- }
- else//除此情况外(2,3,4)
- {
- while(current != && current->index < index)//过滤,两个条件,保证current指向应该指的结点,或其之后的结点。prev指向值小于应该的结点。
- {
- prev = current;
- current = current->next;//别忘了自增
- }
- /*2选1
- * if(current == start)//插到最前面,current所指结点大于等于它
- {
- if(current->index == index)//等于
- {
- current->value = value;
- }
- else//大于
- {
- node *other = new node(index, value, start);
- start = other;
- }
- }
- else if(current == 0)//插到最后面,current所指结点小于它
- {
- node *other = new node(index, value, 0);
- prev->next = other;
- }
- else//插到中间,current所指结点大于等于它
- {
- if(current->index == index)//current所指结点等于它
- {
- current->value = value;
- }
- else//current所指结点结点大于它
- {
- node *other = new node(index, value, current);
- prev->next = other;
- }
- }
- */
- if(current == )//插到最后边
- {
- node *other = new node(index, value);
- prev->next = other;
- }
- else if(current -> index == index)//current所指结点等于它的值
- {
- current->value =value;
- }
- else if(current == start)//在最开始的地方
- {
- node *other = new node(index, value, start);
- start = other;
- }
- else //在中间
- {
- node *other = new node(index, value, current);
- prev->next = other;
- }
- }
- }
- void SparseVector::removeElem(int index)
- {
- node *current = start;
- node *prev = ;
- while(current != && current->index < index)//过滤
- {
- prev = current;
- current = current->next;
- }
- if(current->index == index)//如果是这个结点
- {
- if(current == start)//是开始结点
- {
- prev = current;
- current = current->next;
- delete prev;
- start = current;
- return;
- }
- else//是中间结点或者是后边的节点(相同的)
- {
- prev->next = current->next;
- delete current;
- return;
- }
- }
- else
- {
- return;
- }
- }
- void SparseVector::setElem(int index, int value)
- {
- if(value != )
- {
- setNonzeroElem(index, value);
- }
- else
- {
- removeElem(index);
- }
- }
- void SparseVector::checkListOrder()
- {
- node *current = start;
- while(current != )
- {
- cout<<"("<<current->index<<" | "<<current->value<<")"<<endl;
- current = current->next;
- }
- return;
- }
cs11_c++_lab4a的更多相关文章
- cs11_c++_lab7
wcount.cc #include <iostream> #include <map> #include <string> #include <algori ...
- cs11_c++_lab6
expressions.hh #ifndef EXPRESSIONS_HH #define EXPRESSIONS_HH #include "environment.hh" #in ...
- cs11_c++_lab5待修改
heap.hh #ifndef HEAP_HH #define HEAP_HH #include <iostream> #include <stdexcept> #includ ...
- cs11_c++_lab4b
SparseVector.hh class SparseVector { private: //结构体不一定会用到,不用初始化 struct node { int index; int value; ...
- cs11_c++_lab3
Matrix.hh class Matrix { int row; int col; int *p; void copy(const Matrix &m); void clearup(); p ...
- cs11_c++_lab2
Matrix.hh class Matrix { int row; int col; int *p; public: Matrix(); Matrix(int x,int y); ~Matrix(); ...
- cs11_c++_lab1
lab1.cpp #include "Point.hh" #include <iostream> #include <cmath> using namesp ...
随机推荐
- 2016HUAS_ACM暑假集训4B - 递推
这种数学推理题目题意极其明显,在做的时候,可以多写几组,这样找起规律来会容易些.概括起来就是:题意简单暴力,案例毫无价值. 一个三角形最多可以把一个平面分成两部分,两个三角形最多是8(2+6)部分,而 ...
- kuangbin_SegTree D (POJ 2528)
讲道理我之前暂时跳过染色的题是因为总觉得有什么很高端的算法来query 直到我做了F题(ZOJ 1610)才发现就是个暴力统计.....也对 也就几万个长度单位而已.... F就不po上来了 选了有点 ...
- Ret2Libc 练习(2) -- VirtualProtect
这几天做了NSCTF和GCTF,耽误了几天,今天继续. 这次绕过DEP的方法是利用VirtualProtect函数将shellcode所在的内存属性改成可执行状态就可以绕过DEP了. 首先看一下Vir ...
- [课程设计]Scrum 1.7 多鱼点餐系统开发进度
[课程设计]Scrum 1.7 多鱼点餐系统开发进度(点餐菜式内容添加及美化) 1.团队名称:重案组 2.团队目标:长期经营,积累客户充分准备,伺机而行 3.团队口号:矢志不渝,追求完美 4.团队选题 ...
- 利用web工具splinter模拟登陆做自动签到
首先,我需要的工具和组件有: Chrome浏览器 浏览器驱动ChromeDriver Python 3.5 Web应用测试工具Splinter 代码部分: from splinter import B ...
- [MySQL5.6 新特性] 全局事务标示符(GTID)
GTID的全称为 global transaction identifier , 可以翻译为全局事务标示符,GTID在原始master上的事务提交时被创建.GTID需要在全局的主-备拓扑结构中保持唯 ...
- [linux] linux shell 将解析完毕的文件备份至其他目录
#!/bin/bash # #将解析完毕的日志备份到别的目录 # #日志目录 rjPath=`ls /home/bgftp/orj` #当前时间戳 cur=`date +%s` #一小时 chtm=3 ...
- 在ASP.NET Web API中使用OData
http://www.alixixi.com/program/a/2015063094986.shtml 一.什么是ODataOData是一个开放的数据协议(Open Data Protocol)在A ...
- 重装系统后,delphi7打开报错
delphi7运行不正常的提示unable to rename'c:\program files\Borland\delphi7\Bin\delphi32.$$$'to'c:\program file ...
- vmware12无法打开内核设备“\\.\Global\vmx86”
vmware12 无法打开内核设备"\\.\Global\vmx86": 系统找不到指定的文件.你想要在安装 VMware Workstation 前重启吗? 打开vmware12 ...