【发布时间】:2014-03-26 13:19:31
【问题描述】:
有人可以结束这个算法吗?
void trinti_pasikartojancius(struct el * *prad, struct el * *pab, struct el * elem){
struct el *g, *elemk;
int i =1;
g = *prad;
elem= elem->kitas;
if(g->duom == elem->duom){
elem->kitas->pries = elem->pries;
elem->pries->kitas = elem->kitas;
free(elem);
if( g->kitas != NULL){
g = g->kitas;
g->pries = NULL;
free( *prad );
*prad = g;
}
else{
free ( *prad );
*prad = NULL;
*pab = NULL;
}
}
}
(通过谷歌翻译将变量名称翻译成英文。我相信这个问题的意思是“有人可以完成这个算法吗?”)
void delete_duplicate (struct e ** start, struct ** e end, struct elem * e) {
struct e * g * elemk;
int i = 1;
g = * start;
elem = elem-> next;
if (g-> conn == elem-> data) {
elem-> next-> v = elem-> before;
elem-> v-> next = elem-> next;
free (items);
if (g-> next! = NULL) {
g = g-> next;
g-> before = NULL;
free (* start);
* start = g;
}
else {
free (* start);
* start = NULL;
* end = NULL;
}
}
}
【问题讨论】:
-
问题是什么?
-
上下文是什么?什么是阻塞?为什么变量名称不透明?
-
OP:为清楚起见,我建议您将变量名称从立陶宛语更改为英语。
标签: c list linked-list