·¢²¼Ê±¼ä : ÐÇÆÚÈÕ ÎÄÕµç×ӿƼ¼´óѧ ÆÚÄ© Êý¾Ý½á¹¹ Ä£ÄâÌâ¼°´ð°¸¸üÐÂÍê±Ï¿ªÊ¼ÔĶÁ
}
Èý¡¢Ëã·¨Éè¼ÆÌâ(22·Ö)
1£® Éè¼ÆÔÚÁ´Ê½´æ´¢½á¹¹ÉϺϲ¢ÅÅÐòµÄËã·¨¡£ 2£® Éè¼ÆÔÚ¶þ²æÅÅÐòÊ÷ÉϲéÕÒ½áµãXµÄËã·¨¡£
3£® Éè¹Ø¼ü×ÖÐòÁÐ(k1£¬k2£¬?£¬kn-1)ÊǶѣ¬Éè¼ÆËã·¨½«¹Ø¼ü×ÖÐòÁÐ(k1£¬k2£¬?£¬kn-1£¬x)µ÷
ÕûΪ¶Ñ¡£
25
Êý¾Ý½á¹¹ÊÔ¾í£¨Ò»£©²Î¿¼´ð°¸
Ò»¡¢Ñ¡ÔñÌ⣨ÿÌâ2·Ö£¬¹²20·Ö£©
1.A 2.D 3.D 4.C 5.C 6.D 7.D 8.C 9.D 10.A ¶þ¡¢Ìî¿ÕÌ⣨ÿ¿Õ1·Ö£¬¹²26·Ö£©
1. ÕýÈ·ÐÔ Ò׶ÁÐÔ Ç¿×³ÐÔ ¸ßЧÂÊ 2. O(n)
3. 9 3 3
4. -1 3 4 X * + 2 Y * 3 / - 5. 2n n-1 n+1 6. e 2e 7. ÓÐÏòÎ޻ط
8. n(n-1)/2 n(n-1)
9. £¨12£¬40£© £¨ £© £¨74£© £¨23,55£¬63£© 10.Ôö¼Ó1
11.O(log2n) O(nlog2n) 12.¹é²¢
Èý¡¢¼ÆËãÌ⣨ÿÌâ6·Ö£¬¹²24·Ö£©
1. ÏßÐÔ±íΪ£º£¨78£¬50£¬40£¬60£¬34£¬90£©
?0?1??1??1?02. ÁÚ½Ó¾ØÕó£º?1110?0101??1011??0101?1110??
ÁÚ½Ó±íÈçͼ11Ëùʾ£º
ͼ11
3. Óÿ˳˹¿¨¶ûËã·¨µÃµ½µÄ×îСÉú³ÉÊ÷Ϊ£º (1,2)3, (4,6)4, (1,3)5, (1,4)8, (2,5)10, (4,7)20
4. ¼ûͼ12
2 4 4 2 2
ͼ12 2 4 4 5 4 5 8
2
3 5 4 8 26
2 4 8 3 5
ËÄ¡¢¶ÁËã·¨£¨Ã¿Ìâ7·Ö£¬¹²14·Ö£© 1. £¨1£©²éѯÁ´±íµÄβ½áµã
£¨2£©½«µÚÒ»¸ö½áµãÁ´½Óµ½Á´±íµÄβ²¿£¬×÷ΪеÄβ½áµã £¨3£©·µ»ØµÄÏßÐÔ±íΪ£¨a2,a3,?,an,a1£© 2. µÝ¹éµØºóÐò±éÀúÁ´Ê½´æ´¢µÄ¶þ²æÊ÷¡£ Îå¡¢·¨Ìî¿Õ£¨Ã¿¿Õ2·Ö£¬¹²8 ·Ö£©
true BST->left BST->right Áù¡¢±àдËã·¨£¨8·Ö£©
int CountX(LNode* HL,ElemType x)
{ int i=0; LNode* p=HL;//iΪ¼ÆÊýÆ÷ while(p!=NULL)
{ if (P->data==x) i++; p=p->next;
}//while, ³öÑ»·Ê±iÖеÄÖµ¼´Îªx½áµã¸öÊý return i; }//CountX
Êý¾Ý½á¹¹ÊÔ¾í£¨¶þ£©²Î¿¼´ð°¸
Ò»¡¢Ñ¡ÔñÌâ
1.D 2.B 3.C 4.A 5.A 6.C 7.B 8.C
¶þ¡¢Ìî¿ÕÌâ
1. ¹¹ÔìÒ»¸öºÃµÄHASHº¯Êý£¬È·¶¨½â¾ö³åÍ»µÄ·½·¨ 2. stack.top++£¬stack.s[stack.top]=x 3. ÓÐÐò
2
4. O(n)£¬O(nlog2n) 5. N0-1£¬2N0+N1 6. d/2
7. (31£¬38£¬54£¬56£¬75£¬80£¬55£¬63) 8. (1£¬3£¬4£¬5£¬2)£¬(1£¬3£¬2£¬4£¬5)
Èý¡¢Ó¦ÓÃÌâ
1. (22£¬40£¬45£¬48£¬80£¬78)£¬(40£¬45£¬48£¬80£¬22£¬78) 2. q->llink=p; q->rlink=p->rlink; p->rlink->llink=q; p->rlink=q; 3. 2,ASL=91*1+2*2+3*4+4*2)=25/9 4. Ê÷µÄÁ´Ê½´æ´¢½á¹¹ÂÔ£¬¶þ²æÊ÷ÂÔ
5. E={(1£¬3)£¬(1£¬2)£¬(3£¬5)£¬(5£¬6)£¬(6£¬4)} 6. ÂÔ
ËÄ¡¢Ëã·¨Éè¼ÆÌâ
1. ÉèÓÐÒ»×é³õʼ¼Ç¼¹Ø¼ü×ÖÐòÁУ¨K1£¬K2£¬?£¬Kn£©£¬ÒªÇóÉè¼ÆÒ»¸öËã·¨Äܹ»ÔÚO(n)µÄʱ
¼ä¸´ÔÓ¶ÈÄÚ½«ÏßÐﱒȨ·Ö³ÉÁ½²¿·Ö£¬ÆäÖÐ×ó°ë²¿·ÖµÄÿ¸ö¹Ø¼ü×Ö¾ùСÓÚKi£¬ÓҰ벿·ÖµÄÿ¸ö¹Ø¼ü×Ö¾ù´óÓÚµÈÓÚKi¡£
27
void quickpass(int r[], int s, int t) {
int i=s, j=t, x=r[s]; while(i while (i r[i]=x; } 2. ÉèÓÐÁ½¸ö¼¯ºÏAºÍ¼¯ºÏB£¬ÒªÇóÉè¼ÆÉú³É¼¯ºÏC=A¡ÉBµÄËã·¨£¬ÆäÖм¯ºÏA¡¢BºÍCÓà Á´Ê½´æ´¢½á¹¹±íʾ¡£ typedef struct node {int data; struct node *next;}lklist; void intersection(lklist *ha,lklist *hb,lklist *&hc) { lklist *p,*q,*t; for(p=ha,hc=0;p!=0;p=p->next) { for(q=hb;q!=0;q=q->next) if (q->data==p->data) break; if(q!=0){ t=(lklist *)malloc(sizeof(lklist)); t->data=p->data;t->next=hc; hc=t;} } } Êý¾Ý½á¹¹ÊÔ¾í£¨Èý£©²Î¿¼´ð°¸ Ò»¡¢Ñ¡ÔñÌâ 1.B 2.B 3.A 4.A 5.A 6.B 7.D 8.C 9.B 10.D µÚ3СÌâ·ÖÎö£ºÊ×ÏÈÓÃÖ¸Õë±äÁ¿qÖ¸Ïò½áµãAµÄºó¼Ì½áµãB£¬È»ºó½«½áµãBµÄÖµ¸´ÖƵ½½áµãAÖУ¬×îºóɾ³ý½áµãB¡£ µÚ9СÌâ·ÖÎö£º9¿ìËÙÅÅÐò¡¢¹é²¢ÅÅÐòºÍ²åÈëÅÅÐò±ØÐëµÈµ½Õû¸öÅÅÐò½áÊøºó²ÅÄܹ»Çó³ö×îСµÄ10¸öÊý£¬¶ø¶ÑÅÅÐòÖ»ÐèÒªÔÚ³õʼ¶ÑµÄ»ù´¡ÉÏÔÙ½øÐÐ10´Îɸѡ¼´¿É£¬Ã¿´ÎɸѡµÄʱ¼ä¸´ÔÓ¶ÈΪO(log2n)¡£ ¶þ¡¢Ìî¿ÕÌâ 1. ˳Ðò´æ´¢½á¹¹¡¢Á´Ê½´æ´¢½á¹¹ 2. 9£¬501 3. 5 4. ³ö¶È£¬Èë¶È 5. 0 6. e=d 7. ÖÐÐò 8. 7 28