¼ÙÈçÒ»¸ö΢´¦ÀíÆ÷ ʹÓà 2bytes ÓÃÓÚ integers£»1 byte ÓÃÓÚ characters£»
ÓÐÈçϳÌÐò
C/C++ code:
unsigned char rij[4]={2,2,3,4};
int *p=(char*)(rij+1);
*p=257;
(char*)p+=1;
*p=1051;
printf("%d%d%d%d\n",*rij,*(rij+1),rij[2],rij[3]);(
Êä³öµÄ½á¹ûÓ¦¸ÃÊÇÊ²Ã´ÄØ£¿
×Ô¼º×ªÔÎÁË Ã»Åª³öÀ´ »¹Çë¸÷λ´ó´óÖ¸µã лл
PS:
¼òµ¥µã˵ ¾ÍÊÇÏëÎÊÏÂ
*p=(char*)rij;
Óë
*p=*rij;
ÓÐÊ²Ã´Çø±ð лл
*p=(char*)rij;
Óë
*p=*rij;
*rijÏ൱ÓÚÈ¡µØÖ·rijÀïÃæµÄÄÚÈÝ£¬¶ø£¨char*£©rij£¬Ï൱ÓÚÀàÐÍÇ¿ÖÆ×ª»»£¬½á¹û»¹ÊÇÒ»¸öÖ¸Õë¡£
Æäʵ¥Ö÷°ÑÎÕסһµã£º
¶ÔÓÚÄãµÄintÐÍÖ¸Õëp£¬p+1£¬Ï൱ÓÚµØÖ·¼Ó2£»¶ø¶ÔÓÚÄãµÄrij£¬rij+1,Ï൱ÓÚµØÖ·¼Ó1.
ÖÁÓÚÊý×éÀïÃæ×îºóµ½µ×ÊÇʲôֵ£¬»¹ÓëÄãcpuÊÇlittle endian»¹ÊÇbig endianÓйء£
int *p=(char*)(rij+1);
Ä㽫һ¸öintÐÍÖ¸Õë½ÓÊÕÒ»¸öcharÐÍÖ¸Õ룬Õâ»á²úÉú´íÎóµÄ£¡
ÔÚVCÖÐshortÊÇ2bytes£¬Èç¹ûÄãµÄ΢´¦ÀíÆ÷µÄCPUģʽÓëPCÏàͬ£¬¿ÉÔÚVCÉϵ¥²½ÔËÐÐÕâ¸ö³ÌÐòÀ´¿´½á¹û£¬µ«Òª°Ñp¶¨ÒåΪshort *p¡£
ѧϰ
¼ÇºÃÖ¸ÕëÖ®¼äµÄת»»ÔÔò£¬´Óchar*תΪint*,´¦ÀíÊý×鷽ʽҲÊǰ´int½øÐУ¬¶àÉÙ×Ö½ÚÊǸù¾ÝCPUµÄintÊǶàÉÙ×Ö½Ú¡£·´¹ýÀ´Ò²Ò»Ñù¡£
int *p=(char*)(rij+1);
Õâ¾äµÈЧÓÚ
int *p;
p =(char*)(rij+1);
¶ø
*p=(char*)rij;
Óë
*p=*rij;
Ïà¹ØÎÊ´ð£º
#include"stdio.h"
#include"stdlib.h"
void ContrTwo(char i)
{
char str1[8];
itoa(i,str1,2);
printf("%s",str1);
}
unsigned char leftRot(char str,int i);
unsign ......
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩ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 ......