C¶¯Ì¬·ÖÅä¶þάÊý×é
¿´ÁËlifanxi²©¿ÍÀïµÄ<ÈçºÎÔÚC++Öж¯Ì¬·ÖÅä¶þάÊý×é>,µØÖ·http://blog.csdn.net/lifanxi/archive/2007/06/13/1649840.aspx
Óе㿴²»Ã÷°×,ÇëÎÊ´úÂëÖеÄrow, col, size¸÷´ú±íʲô?
C/C++ code:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void **darray_new(int row, int col, int size)
{
void **arr;
arr = (void **) malloc(sizeof(void *) * row + size * row * col);
if (arr != NULL)
{
void *head;
head = (void *) arr + sizeof(void *) * row;
memset(arr, 0, sizeof(void *) * row + size * row * col);
while (row--)
arr[row] = head + size * row * col;
}
return arr;
}
void darray_free(void **arr)
{
if (arr != NULL)
free(arr);
}
ÐÐ ÁÐ ´óС
row:ÐÐÊý
column:ÁÐÊý
size:Êý×éÀàÐÍËùÕ¼ÄÚ´æ´óС£¨char¾ÍÊÇ1À²£©
C/C++ code:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void **darray_new(int row, int col, int size)
{
void **arr;
//ÏÈÉêÇëÄڴ棬ÆäÖÐsizeof(void *) * row±íʾ´æ·Årow¸öÐÐÖ¸Õë
arr = (void **) malloc(sizeof(void *) * row + size * row *
Ïà¹ØÎÊ´ð£º
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......
°ï°ï棬лл~
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 ......
VC6.0²»ÄÜÓã¬VSϵÁÐÌ«´ó£¬Äܲ»ÄÜÍÆ¼ö¼¸¿îСÇɵÄC/C++µÄIDE
ûÓС£Â¥ÏµÄÀ¬»ø»Ø´ð
http://topic.csdn.net/u/20100105/09/c854cc79-c8b0-4c1a-a8cf-9ab001ab13a5.html?76698
VC6.0ÎÒwindows7ÄÜÓÃ
ÆäËûµÄ
DEV ......
ÎÒÏÖÔÚÏë×öÒ»¸ö»ùÓÚTCPµÄ C/SµÄÁÄÌì³ÌÐò£¬Ôõô²ÅÄÜʵÏÖÓû§ÐÅÏ¢µÄÈÏÖ¤µÇ¼£¬
socketͨÐŽ¨Á¢Á¬½Óǰ£¬ÏÈ·¢ËÍÓû§Ãû£¬ÃÜÂëµÈ£¬ÈÏÖ¤
Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄÜ·¢ËÍѽ
ÒýÓÃ
Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄ ......