2013年完美世界校園招聘筆試題
阿新 • • 發佈：2018-12-20
1、設有矩陣A1（30*35）、A2（35*15）、A3（15*5）、A4（5*10），M=A1*A2*A3*A4，下列組合計算M所需數乘次數最少的是：A、(A1(A2(A3A4))) B、(A1((A2A3)A4)) C、((A1A2)(A3A4)) D、((A1(A2A3))A4) E、(((A1A2)A3)A4)2、在32位機器上，有如下程式碼：
char array[] = "abcdefg";printf("%d\n",sizeof(array)); // 8char *p = "abcdefg";printf("%d\n",sizeof(p)); // 4 CONTAINER::iterator iter , tempIt;for class classA{public: classA() { clear(); } virtual ~classA() { } void clear() { memset(this , 0 , sizeof(*this)); } virtual void func() { printf("func\n"); }};class classB : public classA{};int main(void){ classA oa; classB ob; classA * pa0 = &oa; classA * pa1 = &ob; classB * pb = &ob; oa.func(); // 1 ob.func(); // 2 pa0->func(); // 3 pa1->func(); // 4 pb->func(); // 5 return 0;}class CBase{public: void func() { Print(); } virtual void Print() { cout<<"CBase::Print"<<endl; }};class CDerived : public CBase{public: virtual void Print() { cout<<"CDerived::Print"<<endl; }};int main(void){ CDerived c; CBase *p = &c; return 0;}struct Thing{ int valueA; const int valueB;};Thing t;struct st{ char ch , *ptr; union { short a , b; unsigned int c : 2 , d : 1; }; bool f; struct st *next;};char array[12] = {0x01 , 0x02 , 0x03 , 0x04 , 0x05 , 0x06 , 0x07 , 0x08};short *pshort = (short *)array;int *pint = (int *)array;int64 *pint64 = (int64 *)array;printf("0x%x , 0x%x , 0x%x , 0x%x", *pshort , *(pshort+2) , *pint64 , *(pint+2));