linux c Êý×é¿Õ¼äÊÍ·Å
Çë½Ì¸ßÊÖÒ»¸öÎÊÌ⣬ÔÚlinuxÏÂÎÒÖªµÀÒ»¸öÊý×éµÄ´óС È磺long arry[100000] Õâ¸öÊý×éÊÇÔÚÑ»·ÀﶨÒåµÄ£¬Ê¹ÓÃÍê³öÁËÑ»·Ì壬 arryÊý×éÓÐûÓÐɶ°ì·¨¿ÉÒÔÂíÉÏÊͷŵô£¿
¶ÑÕ»ÉϵÄûÓа취ÊÍ·Å¡£ long * arry = malloc(sizeof(long)*100000); free(arry); ÕâÑùµÄ¿ÉÒÔ ²Ù×÷ϵͳ¹ÜÀíµÄ¡£Äã³öÁ˺¯Êý²ÅÊÍ·ÅÄØ¡£ ËùÒÔ¿ÉÒÔÔÚÑ»·Àï¸ã¸öº¯ÊýÂ𣡠лл£¡ÎÒµÄÕâ¸ölong arry[100000]ÊÇÔÚÒ»¸öº¯ÊýÀﶨÒåʹÓõģ¬Ôڸú¯Êýµ÷ÓÃʹÓÃÍêºó£¬ËüµÄ¿Õ¼ä»áµÃµ½ÊÍ·ÅÂ𣿠ÊÇ¿ÉÒԵġ£º¯Êýµ÷ÓÃÊÇÔÚÕ»Éϵġ£ ×Ô¶¯±äÁ¿Í˳öº¯Êý»áÊÍ·ÅµÄ ÓÃallocÖ±½ÓÔÚ¶ÑÕ»ÖзÖÅ䣬¿ÉÒÔ²»ÓÃÊÍ·Å Ôڸú¯Êýµ÷ÓÃʹÓÃÍêºó£¬ËüµÄ¿Õ¼ä»áµÃµ½ÊÍ·ÅÒýÓà лл£¡ÎÒµÄÕâ¸ölong arry[100000]ÊÇÔÚÒ»¸öº¯ÊýÀﶨÒåʹÓõģ¬Ôڸú¯Êýµ÷ÓÃʹÓÃÍêºó£¬ËüµÄ¿Õ¼ä»áµÃµ½ÊÍ·ÅÂ𣿠»áµÄ¡£ Äã¿ÉÒÔʹÓÃ{}ÏÞ¶¨Õâ¸öÊý×éµÄ×÷ÓÃÓò Ñ»·ÌåÀïµÄÁÙʱÊý×éÊÇÔÚ¶ÑÕ»ÀïµÄ£¬º¯ÊýÍ˳öºó£¬»á×Ô¶¯ÊÍ·Å¡£¶Ô³ÌÐòÄÚ²¿¶øÑÔ£¬ÕâÖÖÊͷŶ¯×÷Ö»ÊǶÑÕ»¼Ä´æÆ÷µÄ¼Ó¼õ¶øÒÑ¡£ ·Ç³£¸Ðл¸÷λµÄ»Ø¸´!
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏ struct hostent *hp; char AlarmDevIP[20]; int x2; hp = gethostbyname("www.google.com"); if (hp) {
......
×ÉѯQQ£º269562808 bzip2recover ¹¦ÄÜ˵Ã÷£ºÓÃÀ´ÐÞ¸´Ë𻵵Ä.bz2Îļþ¡£ Óï·¨£ºbzip2recover[.bz2ѹËõÎļþ] ²¹³ä˵Ã÷£ºbzip2ÊÇÒÔÇø¿éµÄ·½Ê½À´Ñ¹ËõÎļþ£¬Ã¿¸öÇø¿éÊÓΪ¶ÀÁ¢µÄµ¥Î»¡£Òò´Ë£¬µ±Ä³Ò»Çø ¿éËð»µÊ±£¬±ã¿ÉÀû ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
°ï°ï棬лл~ 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 ......