- 博客(7)
- 收藏
- 关注
RSS订阅转载 remove1
Error_code List::remove(int position, List_entry &x){ if(count==0) return underflow; if(position=count) return range_error; x=entry[position]; for(int i=position;i
2013-09-26 19:50:35
409
转载 remove
Error_code List::remove(int position,List.entry &x){ if(count==0) return underflow; if(position=count) return range_enor; Node *new_node,*previous,*followig; if(positio
2013-09-26 19:38:36
409
转载 Exercise3.3
E7 Rewrite the methods for queue processing from the text ,using a flag to indicate a full queue instead of keeping a count of the entries in the queue The class definition for this Queue
2013-09-26 19:36:13
471
原创 9.11
Exercises 4.2E2 Consider a linked stack that includes a method size .That method size requires a loop that moves through the entire stack to count the entires,since the number of entries in the
2013-09-11 21:08:08
321
原创 Exercise4.1
Exercise 4.1 E1 Draw a diagram to illustrate the configuration of linked nodes that is created by the following statements. Node *p0=new Node(‘0’) Node *p1=p0->next=new Node(‘1’);
2013-09-05 17:18:26
523
原创 zuoye
#include#include char str[1000005],ttr[1000005];int main(){ int x,len,i,k,flag,ji; scanf("%d",&x); getchar(); while(x--) { flag=0; gets(str); ji=0;
2013-08-29 21:16:52
299
原创 Programming Principles Summary 编程原则总结
ProgrammingPrinciples Summary编程原则总结Programming Precept :u Methodsof a class are public .Function in a class are private. 一个类的方法是公用的，一个类中的函数是私有的。u Includeprecise pr
2013-08-22 20:32:22
460
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人