//1.实现strcpy.
char* MyStrCpy( char *pDest, const char *pSrc )
{
if( nullptr == pDest || nullptr == pSrc ){
return nullptr;
}
if( pDest == pSrc ){
return pDest;
}
char *pIter = pDest;
while( ( *pIter++=*pSrc++ ) !='\0' );
return pDest;
} //2.实现strcat.
0. char* MyStrCat( char *pDest, const char *pSrc )
0. {
0. if( nullptr == pDest || nullptr == pSrc )
0. {
0. return nullptr;
0. }
0.
0. char *pIter = pDest + strlen( pDest );
0. while( ( *pIter++=*pSrc++ ) != '\0' );
0. return pDest;
0. }
//3.实现CString字符串类缺省四个方法
0. class MyCString
0. {
0. public:
0.
0. MyCString( char *pData = nullptr )
0. {
0. if( nullptr == pData )
0. {
0. mpData = new char[ 1 ];
0. assert( nullptr != mpData );
0. *mpData = '\0';
0. }
0. else
0. {
0. mpData = new char[ strlen( pData ) + 1 ];
0. assert( nullptr != mpData );
0. strcpy( mpData, pData );
0. }
0. }
0.
0. MyCString( const MyCString &Other )
0. {
0. mpData = new char[ strlen( Other.mpData ) + 1 ];
0. assert( nullptr != mpData );
0. strcpy( mpData, Other.mpData );
0. }
0.
0. ~MyCString()
0. {
0. if( nullptr != mpData )
0. {
0. delete [] mpData;
0. mpData = nullptr;
0. }
0. }
0.
0. const MyCString& operator =( const MyCString &Other )
0. {
0. if( this == &Other )
0. {
0. return *this;
0. }
0. delete [] mpData;
0. mpData = new char[ strlen( Other.mpData ) + 1 ];
0. assert( nullptr != mpData );
0. strcpy( mpData, Other.mpData );
0. return *this;
0. }
0.
0. private:
0.
0. char *mpData;
0. };
//4.不使用第三个变量交换两个数的值
0. void SwapA( int &A, int &B )
0. {
0. if( A == B )
0. {
0. return;
0. }
0. A = A + B;
0. B = A - B;
0. A = A - B;
0. }
0. void SwapB( unsigned int &A, unsigned int &B )
0. {
0. if( A == B )
0. {
0. return;
0. }
0. A = A ^ B;
0. B = A ^ B;
0. A = A ^ B;
0. } //5.C语言中字符串转数字的方法是什么( atoi )，请实现它
2. int Myatoi( const char *pString )
3. {
4. assert( nullptr != pString );
5. const int Len = strlen( pString );
6. int Value = 0;
7. int Times = 1;
8. for( int i = Len -1; i >= 0; --i, Times *= 10 )
9. {
10. Value += ( pString[ i ] - '0' ) * Times;
11. }
12. return Value;
13. }
//6.实现一个将字符串逆序的方法
16. char* MyInverted( char *pDest )
17. {
18. assert( nullptr != pDest );
19. const int Len = strlen( pDest );
20. char T = 0;
21. for( int i = 0; i < Len / 2; ++i )
22. {
23. T = pDest[ i ];
24. pDest[ i ] = pDest[ Len - i - 1 ];
25. pDest[ Len - i -1 ] = T;
26. }
27. return pDest;
28. }
//7.实现一个将字符串中所有字母转换为大写的方法
31. char* MyUpper( char *pDest )
32. {
33. assert( nullptr != pDest );
34. for( char *i = pDest; *i != '\0'; ++i )
35. {
36. if( *i < 'a' || *i > 'z' )
37. {
38. continue;
39. }
40. *i -= 'a' - 'A';
41. }
42. return pDest;
43. }
//8.已知一个数组已经降序排序请用二分查字法找到其中的某个元素找到返回索引否则返回-1
46. int BinarySearch( int *pArray, int Count, int Value )
47. {
48. assert( nullptr != pArray );
49. int Left = 0;
50. int Right = Count -1;
51. int Mid = 0;
52. while( Left <= Right )
53. {
54. Mid = ( Left + Right ) / 2;
55. if( Value < pArray[ Mid ] )
56. {
57. Right = Mid - 1;
58. }
59. else if( Value > pArray[ Mid ] )
60. {
61. Left = Mid + 1;
62. }
63. else
64. {
65. return Mid;
66. }
67. }
68. return -1;
69. }
70.
71. struct Node
72. {
73. Node *mpNext;
74. int mData;
75. }; //9.删除链表中值为Value的所有元素( [Head]->[node1]->[node2]->...[noden] )
77. void DeleteFromList( Node *pHead, int Value )
78. {
79. Node *pPrev = pHead;
80. Node *pNext = pHead->mpNext;
81. while( nullptr != pNext )
82. {
83. if( pNext->mData != Value )
84. {
85. pPrev = pNext;
86. pNext = pNext->mpNext;
87. }
88. else
89. {
90. pPrev->mpNext = pNext->mpNext;
91. delete pNext;
92. pNext = pPrev->mpNext;
93. }
94. }
95. }
//10.在链表Index位置插入新的值为Value的元素
98. void InsertFromList( Node *pHead, int Index, int Value )
99. {
100. Node *pIter = pHead;
101. for( int i = 0; i < Index && nullptr != pIter; ++i, pIter = pIter->mpNext );
102. assert( nullptr != pIter );
103. Node *pNew = new Node;
104. pNew->mData = Value;
105. pNew->mpNext = pIter->mpNext;
106. pIter->mpNext = pNew;
107. }
//11.将链表逆序
110. Node* InvertedFromList( Node *pHead )
111. {
112. //A->B->C
113. Node *pPrev = pHead; //A
114. Node *pNext = pHead->mpNext; //B
115. Node *pNextNext = nullptr; //C
116. while( nullptr != pNext )
117. {
118. pNextNext = pNext->mpNext; //C = B->C
119. pNext->mpNext = pPrev; //B->A
120.
121. pPrev = pNext; //A = B
122. pNext = pNextNext; //B = C
123. }
124. pHead->mpNext = nullptr;//C->B->A->null
125. return pPrev; //return C( new head )
126. }
//12.判断X年X月X日是这年的第几天
129. int GetDay( int Year, int Month, int Day )
130. {
131. int MonthDays[ 13 ] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
132.
133. if( ( Year % 4 == 0 && Year % 100 != 0 ) || ( Year % 400 == 0 ) )
134. {
135. ++MonthDays[ 2 ];
136. }
137.
138. int Days = 0;
139. for( int i = 1; i < Month; ++i )
140. {
141. Days += MonthDays[ i ];
142. }
143. Days += Day;
144.
145. return Days;
146. }
//13.求斐波拉契数列第N项
148. int GetFibonacci1( int N )
149. {
150. if( 1 == N || 2 == N )
151. {
152. return 1;
153. }
154. if( 3 == N )
155. {
156. return 2;
157. }
158. int A = 2;
159. int B = 3;
160. int C = 5;
161. for( int i = 0; i < N - 4; ++i )
162. {
163. C = A + B;
164. A = B;
165. B = C;
166. }
167. return C;
168. } //14.递归求斐波拉契数列数列第N项
171. int GetFibonacci2( int N )
172. {
173. if( 1 == N || 2 == N )
174. {
175. return 1;
176. }
177. return GetFibonacci2( N - 1 ) + GetFibonacci2( N - 2 );
178. }
179. //15.实现一个产生[N-M]区间数字的随机方法
180. int GetRandomRange( int N, int M )
181. {
182. if( N == M )
183. {
184. return N;
185. }
186. if( N > M )
187. {
188. N = N + M;
189. M = N - M;
190. N = N - M;
191. }
192. return N + ( rand() % ( M - N + 1 ) );
193. }
//15.实现一个产生[0~1]之间的随机浮点数
196. double GetRandomRange()
197. {
198. return rand() / static_cast< double >( RAND_MAX );
199. }
200. //17.实现一个打印出1-1000之间的所有素数的方法
201. void PrintfPrime()
202. {
203. //1不是素数
204. //2是最小非奇数素数
205. //直接从3开始
206. printf( "2\n" );
207. bool b = false;
208. for( int i = 3; i <= 1000; ++i )
209. {
210. b = true;
211. for( int j = 2; j <= i / 2; ++j )
212. {
213. if( i % j == 0 )
214. {
215. b = false;
216. break;
217. }
218. }
219. if( b )
220. {
221. printf( "%d\n", i );
222. }
223. }
224. }
//16.已知Z = X + Y 其中 Z, X, Y 均为无符号int型 定义一个宏判断Z是否已经越界
#define IS_OVER_FLOW( Z, X, Y ) ( Z < ( ( X ) < ( Y ) ? ( Y ) : ( X ) ) )
//17.请用栈实现队列
230. int QueuePop( std::stack< int > &StackA )
231. {
232. std::stack< int > StackB;
233. while( false == StackA.empty() )
234. {
235. StackB.push( StackA.top() );
236. StackA.pop();
237. }
238.
239. const int top = StackB.top();
240. StackB.pop();
241.
242. while( false == StackB.empty() )
243. {
244. StackA.push( StackB.top() );
245. StackB.pop();
246. }
247. return top;
248. } . //18.实现一个产生[0~1]之间的随机浮点数
double GetRandomRange()
{
return rand() / static_cast< double >( RAND_MAX );
}
//19.实现一个打印出1-1000之间的所有素数的方法
201. void PrintfPrime()
202. {
203. //1不是素数
204. //2是最小非奇数素数
205. //直接从3开始
206. printf( "2\n" );
207. bool b = false;
208. for( int i = 3; i <= 1000; ++i )
209. {
210. b = true;
211. for( int j = 2; j <= i / 2; ++j )
212. {
213. if( i % j == 0 )
214. {
215. b = false;
216. break;
217. }
218. }
219. if( b )
220. {
221. printf( "%d\n", i );
222. }
223. }
224. }
- //20.已知X班X成绩0-100分编写一个方法实现0-59打印不合格,60-69打印合格,70-79打印良好,80-100打印优秀
- //不能使用if,:?,switch
-
252. void PrintScore( int Score ) 253. { 254. assert( Score >= 0 && Score <= 100 ); 255. const char *pString[] = 256. { 257. "不合格", 258. "不合格", 259. "不合格", 260. "不合格", 261. "不合格", 262. "不合格", 263. "合格", 264. "良好", 265. "优秀", 266. "优秀", 267. "优秀", 268. }; 269. printf( "%s\n", pString[ Score / 10 ] ); 270. }//21.实现strncpy
-
272. char *Mystrncpy( char *pDest, const char *pSrc, int Count ) 273. { 274. assert( NULL != pDest && NULL != pSrc ); 275. if( pDest == pSrc ) 276. { 277. return pDest; 278. } 279. if( Count <= 0 ) 280. { 281. return pDest; 282. } 283. char *pStart = pDest; 284. while( ( Count-- ) > 0 && ( *pStart++=*pSrc++ ) ); 285. *pStart = '\0'; 286. return pDest; 287. }//22.C语言中数字转字符串的方法是什么？(itoa)请实现他
-
289. char* Myitoa( char *pDest, int val, int radix ) 290. { 291. assert( NULL != pDest ); 292. assert( radix > 1 ); 293. const bool IsMinu = val < 0; 294. char buffer[ 16 ] = {}; 295. int count = 0; 296. 297. do 298. { 299. buffer[ count++ ] = abs(val) % radix; 300. val /= radix; 301. } 302. while( val ); 303. 304. 305. if( IsMinu ) 306. { 307. pDest[ 0 ] = '-'; 308. for( int i = 0; i < count; ++i ) 309. { 310. pDest[ i + 1 ] = '0' + buffer[ count - i - 1 ]; 311. } 312. pDest[ count + 1 ] = '\0'; 313. } 314. else 315. { 316. for( int i = 0; i < count; ++i ) 317. { 318. pDest[ i ] = '0' + buffer[ count - i - 1 ]; 319. } 320. pDest[ count ] = '\0'; 321. } 322. return pDest; 323. }. //23.如何判断链表是否有环
-
325. bool IsLoop( Node *pHead ) 326. { 327. //[H->A->B->C->A] 328. assert( NULL != pHead ); 329. Node *pNext = pHead->mpNext; 330. Node *pNextNext = pHead->mpNext; 331. while( NULL != pNext && NULL != pNextNext->mpNext ) 332. { 333. pNext = pNext->mpNext;//[ B、C、A ] 334. pNextNext = pNextNext->mpNext->mpNext;//[C、B、A] 335. if( pNext == pNextNext ) 336. { 337. return true; 338. } 339. } 340. return false; 341. }//24.统计出一个字符串每种字母出现的次数要求时间复杂度为O(n)
-
343. void CountLetter( const char *pSrc ) 344. { 345. int count[ 256 ] = {}; 346. for( ; *pSrc !='\0'; ++pSrc ) 347. { 348. const char &c = *pSrc; 349. if( ( c < 'A' || c > 'z') && ( c < 'a' || c > 'z' ) ) 350. { 351. continue; 352. } 353. ++count[ c ]; 354. } 355. }//25.选择排序的思想是什么？( 每次找到最大或最小的值放在数组的低位上 )请实现它
-
357. void SelectSort( int *pArray, int count ) 358. { 359. for( int i = 0; i < count; ++i ) 360. { 361. //默认低位元素最小 362. int MinValue = pArray[ i ]; 363. //默认保存低位元素的索引 364. int MinIndex = i; 365. //除开第一个元素找是否还有比它还小的元素( 升序 ) 366. for( int j = i + 1; j < count; ++j ) 367. { 368. //发现找到比它还小的元素重新赋值和保存索引 369. if( pArray[ j ] < MinValue ) 370. { 371. MinValue = pArray[ j ]; 372. MinIndex = j; 373. } 374. } 375. //将找到最小元素放在数组低位上面 376. const int Temp = pArray[ i ]; 377. pArray[ i ] = MinValue; 378. pArray[ MinIndex ] = Temp; 379. } 380. }//26.冒泡排序的思想是什么?(升序排序中越小的数往低位走，越大的数往高位走,每次与相邻元素比较导致的特点)请实现它
-
383. void BubbleSort( int *pArray, int count ) 384. { 385. //eg.[6][8][8][0][9][1] 386. //i = 0,j < 5 [6][8][0][8][1][9] 387. //i = 1,j < 4 [6][0][8][1][8][9] 388. //i = 2,j < 3 [0][6][1][8][8][9] 389. //i = 3,j < 2 [0][1][6][8][8][9] 390. 391. //到此为止已经排序OK了 392. //i = 4,j < 1 [0][1][6][8][8][9] 393. //i = 5,j < 0 [0][1][6][8][8][9] 394. for( int i = 0; i < count; ++i ) 395. { 396. for( int j = 0; j < count - i - 1; ++j ) 397. { 398. if( pArray[ j ] > pArray[ j + 1 ] ) 399. { 400. const int Temp = pArray[ j ]; 401. pArray[ j ] = pArray[ j + 1 ]; 402. pArray[ j + 1 ] = Temp; 403. } 404. } 405. } 406. }//27.已知两个数组有序实现一个方法将他们合并后任然有序
-
409. void MergeSort( int *pMerge, int *p1, int p1len, int *p2, int p2len ) 410. { 411. assert( nullptr != pMerge && nullptr != p1 && nullptr != p2 ); 412. int i = 0; 413. int j = 0; 414. int k = 0; 415. while( i < p1len && j < p2len ) 416. { 417. if( p1[ i ] < p2[ j ] ) 418. { 419. pMerge[ k ] = p1[ i ]; 420. ++k; 421. ++i; 422. } 423. else 424. { 425. pMerge[ k ] = p2[ j ]; 426. ++k; 427. ++j; 428. } 429. } 430. while( i < p1len ) 431. { 432. pMerge[ k ] = p1[ i ]; 433. ++k; 434. ++i; 435. } 436. while( j < p2len ) 437. { 438. pMerge[ k ] = p2[ j ]; 439. ++k; 440. ++j; 441. } 442. }//28.实现一个算法找到数组中第二大的数
-
445. int FindSec( int *p, int len ) 446. { 447. assert( nullptr != p ); 448. int maxv = p[ 0 ]; 449. int secv = p[ 0 ]; 450. for( int i = 1; i < len; ++i ) 451. { 452. if( maxv < p[ i ] ) 453. { 454. secv = maxv; 455. maxv = p[ i ]; 456. } 457. } 458. return secv; 459. }
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
