Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

CµÄһЩÎÊÌâ

1.ÏÂÃæ³ÌÐòµÄÒýÓÃΪʲô²»ÄÜʵÏÖ,ºìÉ«µÄµØ·½
////
#include <stdio.h>
#include <stdlib.h>

#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OK 1
#define ERROR -1

typedef struct{
int *elem;
int length;
int listsize;
}Sqlist;
typedef int Status;

Status InitList_Sq(Sqlist &L){
L.elem=(int *)malloc(LIST_INIT_SIZE * sizeof(int));
if(!L.elem)
exit(0);
L.length=0;
L.listsize=LIST_INIT_SIZE;
return OK;
}

Status ListInsert_Sq(Sqlist &L ,int i,int e){
int *newbase;
if(i <1||i>L.length+1)
return ERROR;
if(L.length>=L.listsize){
newbase=(int *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(int));
if(!newbase)
exit(0);
L.elem=newbase;
L.listsize+=LISTINCREMENT;
}
int *p,*q;
q=&(L.elem[i-1]);
for(p=&(L.elem[L.length-1]);p>=q;--p)
*(p+1)=*p;
*q=e;
++L.length;
return OK;
}


void main(){
Sqlist la;
InitList_Sq(la);
ListInsert_Sq(la,1,8);

} return OK;
}


void main(){
Sqlist la;
InitList_Sq(la);
ListInsert_Sq(la,1,8);
}
///////////
2.ÏÂÃæµÄ½á¹¹ÌåµÄ¶¨ÒåÓÐÊ²Ã´Çø±ð????


Ïà¹ØÎÊ´ð£º

c,c++Á¬½Ómysql ÕÒ²»µ½Í·²¿Îļþ£¨ÐÂÊÖ£©

±àÒëÆ÷£ºC-Free4
mysql µ¥¶À°²×°µÄ£¬ÏÖÔÚΪapache+php+mysql¿ÉÒÔʹÓá£
×î½üÔÚÁ·Ï°c£¬c++£»ÏëÓÃc£¬c++Á¬½ÓÏÂÎÒµÄmysql£¬ºÃ¶àµØ·½¶à˵mysql.hÕÒ²»µ½¡£¶øÇÒÎÒmysqlûÓÐËùνµÄincludeÎļþ¼Ð°¡¡£
Íü¸ßÊÖÖ¸µãÒ»¶ ......

³ÖÐø¼¯³É-CÏîÄ¿ - C/C++ / CÓïÑÔ

¸÷λ´óÏÀ£º
ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......

C/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý - C/C++ / C++ ÓïÑÔ

´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......

cÓïÑÔʵÏÖlinux timeÏà¹Øº¯Êý - C/C++ / CÓïÑÔ

ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ