狠狠撸

膼峄� b脿i 2 - KHTN 2010.
Xem m茫 ngu峄搉 C++ 膽瓢峄 vi岷縯 trong b岷g sau 膽芒y (ch煤媒 c谩c ph瓢啤ng th峄ヽ岷).
PHP Code:
#include <iostream>
using namespace std;
class ListItem{
protected:
int Index;
ListItem* nextItem;
public:
ListItem (int idx = 0){
Index = idx;
nextItem = NULL;
}
ListItem* addFront (int idxNew){
ListItem* anItem = create(idxNew);
anItem->nextItem = this;
return anItem;
}
void outFromThis (ostream& oDev){
ListItem* pItem = this;
while (pItem != NULL){
pItem->outItem(oDev);
pItem = pItem->nextItem;
}
}
virtual void outItem (ostream& outDev){
outDev << Index <<"";
}
virtual ListItem* create (int idxNew){
return new ListItem(idxNew);
}
ListItem* searchFromThis(int idx);//s岷� c脿i 膽岷穞....
};
class LinkedList{
protected:
ListItem* firstItem;
public:
LinkedList (ListItem* head = NULL){
firstItem = head;
}
ListItem* add (int idxNew){
if (firstItem != NULL)
firstItem = firstItem->addFront(idxNew);
else
firstItem = new ListItem(idxNew);
return firstItem;
}
void out (ostream& oDev){
if (firstItem != NULL)
firstItem->outFromThis(oDev);
}
bool isEmpty(){
return (firstItem == NULL);
}
ListItem* search(int idx); //s岷� c脿i 膽岷穞....
};
void main(){

LinkedList* myList = new LinkedList();
int indices[] = {8, 9, 9, 1, 0, 1, 0, 2};
int n = sizeof(indices)/sizeof(indices[0]);
for (int i = 0; i < n; i++)
myList->add(indices[i]);
myList->out(cout);
}
M峄梚膽峄慽 t瓢峄g thu峄檆 l峄沺 ListItem c贸 tr瓢峄漬g nextItem b岷眓g NULL (ngh末a l脿膽峄玭g) hay l脿 tr峄� 膽岷縩 m峄檛 ph脿n t峄� k岷� ti岷縫
c农ng l脿 m峄檛膽峄慽 t瓢峄g thu峄檆 l峄沺 n脿y, t峄ヽ l脿 m峄梚膽峄慽 t瓢峄g nh瓢 v岷瓂 c农ng l脿 ph岷 t峄� 膽岷 ti锚n c峄 m峄檛 danh s谩ch li锚n
k岷縯 (ph岷 t峄� 膽岷 m峄檛 x芒u).
a/ Kh么ng k峄� hai ph瓢啤ng th峄ヽ ch瓢a c脿i 膽岷穞 searchFromThis(), search() trong hai l峄沺 ListItem, LinkedList, h茫y cho
bi岷縯 k岷縯 qu岷� ch岷 c峄 ch瓢啤ng tr矛nh.
b/ D峄盿 v脿o c谩ch vi岷縯 ph瓢啤ng th峄ヽ outFromThis(), h茫y c脿i 膽岷穞 ph瓢啤ng th峄ヽ searchFromThis() c峄 l峄沺 ListItem theo
h瓢峄沶g d岷玭 nh瓢 sau:
PHP Code:
ListItem* ListItem::searchFromThis (int idx){
//B岷 vi岷縯 th锚m c谩c d貌ng m茫 ngu峄搉 t岷 膽芒y....
//
}
膽峄� t矛m v脿 tr岷� v峄� ph岷 t峄� 膽岷 ti锚n trong x芒u (kh峄焛膽岷 t峄� 膽峄慽 t瓢峄g 膽ang x茅t c峄 l峄沺 ListItem) c贸 tr瓢峄漬g Index b岷眓g
v峄沬 gi谩 tr峄� c峄 tham s峄� idx (tr岷� v峄� NULL n岷縰 t矛m kh么ng c贸).
c/ Vi岷縯 ph瓢啤ng th峄ヽ search() c峄 l峄沺 LinkedList 膽峄� t矛m v脿 tr岷� v峄� ph岷 t峄� 膽岷 ti锚n trong x芒u (kh峄焛膽岷 t峄� 膽峄慽 t瓢峄g
膽ang x茅t c峄 l峄沺 ListItem) c贸 tr瓢峄漬g Index b岷眓g v峄沬 gi谩 tr峄� c峄 tham s峄� idx (tr岷� v峄� NULL n岷縰 t矛m kh么ng c贸).
Xem m茫 ngu峄搉 c峄 l峄沺 Point (t峄峚膽峄� 膽i峄僲 trong m岷穞 ph岷硁g) v脿 l峄沺 Polygon (膽a gi谩c) k岷� th峄玜 t峄� c谩c l峄沺 ListItem,
LinkedList b锚n tr锚n v脿 h脿m main() 膽瓢峄 vi岷縯 l岷 nh瓢 sau:
PHP Code:
class Point:public ListItem{
double x, y;
public:
Point (int idxNew): ListItem(idxNew){}
Point(double xx = 0, double yy = 0, int idx = 0):ListItem(idx){
set(xx, yy);
}
void set(double xx, double yy){
x = xx; y = yy;
}
virtual ListItem* create(int idxNew){
return new Point(idxNew);
}
virtual void outItem(ostream& outDev){
outDev <<"(" << x << ","<<y<<")";
}
};
class Polygon: public LinkedList{
int nVer;
public:
Polygon(double xfirst = 0, double yfirst = 0):
LinkedList(new Point(xfirst, yfirst)){
nVer = 1;
}
Point* addVer(double x, double y){
Point* p = (Point*)add(nVer);
p->set(x,y);
nVer++;
return p;
}
static Polygon* read(istream& inDev);//s岷� c脿i 膽岷穞 ....
};
void main(){

Polygon pg(1.9, 8.4);
pg.addVer(1.9, 8.9);
pg.out(cout);
}
d/ H茫y cho bi岷縯 k岷縯 qu岷� ch岷 c峄 ch瓢啤ng tr矛nh.
e/ Ph瓢啤ng th峄ヽ read() c峄 l峄沺 polygon l脿 m峄檛 ph瓢啤ng th峄ヽ t末nh c贸 nhi峄噈 v峄� nh岷璸 d茫y c谩c 膽峄塶h c峄 膽a gi谩c t峄� thi岷縯
b峄� nh岷璸 (m峄梚膽峄塶h g峄搈 m峄檛 ho脿nh 膽峄� v脿 tung 膽峄� l脿 c谩c s峄� th峄眂, c谩c s峄� c谩ch nhau b峄焛 d岷 kho岷g tr峄憂g hay k铆 t峄�
ng岷痶) v脿 tr岷� v峄� m峄檛膽峄慽 t瓢峄g c峄 l峄沺 Polygon. H茫y vi岷縯 m茫 ngu峄搉膽岷 膽峄� c峄 ph瓢啤ng th峄ヽ n脿y theo h瓢峄沶g d岷玭
sau:
PHP Code:
Polygon* Polygon::read(铆tream& inDev){
Polygon* poly;
//B岷 vi岷縯 th锚m c谩c d貌ng m茫 ngu峄搉 t岷 膽芒y....
//..........
return poly;
}

狠狠撸

Cau 2

Recommended

More Related Content

What's hot (18)

Viewers also liked (16)

Similar to Cau 2 (20)

More from H峄� L峄 (20)

Cau 2