|
360 isOver = true;
361 }
362 };
363 //算法
364 bool TurnLeft(int Map[4][4])//按向左键进行合并
365 {
366 int k;
367 int len;
368 int Save[4];
369 int Move[4][4];
370 bool CanMove = false;
371
372 for (int i = 0; i < 4; i++)
373 {
374 for (int j = 0; j < 4; j++)
375 {
376 Move[i][j] = Map[i][j];
377 }
378 }
379 for (int i = 0; i < 4; i++)
380 {
381 k = 0;
382 len = 0;
383 for (int j = 0; j < 4; j++)
384 {
385 if (Map[i][j]==0)
386 {
387 continue;
388 }
389 for (k = j+1; k < 4; k++)
390 {
391 if (Map[i][k] != 0 )
392 {
393 if (Map[i][j] == Map[i][k])
394 {
395 Map[i][j] *= 2;
396 Map[i][k] = 0;
397 }
398 break;
399 }
400 }
401 }
402 for (int j = 0; j < 4; j++)
403 {
404 if (Map[i][j]!=0)
405 {
406 Save[len]=Map[i][j];
407 len++;
408 }
409 }
410 for (int j = 0; j < 4; j++)
411 {
412 if (j<len)
413 {
414 Map[i][j] = Save[j];
415 }
416 else
417 {
418 Map[i][j] = 0;
419 }
420 }
421 }
422 for (int i = 0; i < 4; i++)
423 {
424 for (int j = 0; j < 4; j++)
425 {
426 if (Move[i][j] != Map[i][j])
427 {
428 CanMove = true;
429 };
430 }
431 }
432 return CanMove;
433 }
图形库地址：
https://easyx.cn/downloads/
|