C/C++仿華容道小游戲
更新時(shí)間:2016年02月09日 19:09:37 作者:__lurenjia__
這篇文章主要介紹了C/C++仿華容道小游戲的相關(guān)資料,模仿實(shí)現(xiàn)華容道游戲,感興趣的朋友可以參考一下
本文實(shí)例介紹了C++模仿華容道小游戲?qū)崿F(xiàn)代碼,分享給大家供大家參考,具體內(nèi)容如下
#include <stdio.h> #include <stdlib.h> #include <time.h> #include <stdbool.h> #define maxnum 16 #define colnum 4 bool numexists(int *numbers, int length, int num); int getnumber(int **numbers, int randIndex, int *length); int* initnumbers(void); void swap(int **a, int **b); int main(int argc, char *argv[]) { int *tempnumbers = initnumbers(); int *randnumbers = initnumbers(); int **numbers; numbers = malloc(maxnum * sizeof(int*)); //bool a = numexists(numbers, 16, 3); //printf("a=%d\n", a); int length = maxnum; srand((unsigned)time(NULL)); for (int i = 0; i < maxnum; i++) { int temp = getnumber(&tempnumbers, rand() % length, &length); randnumbers[i] = temp; numbers[temp] = &randnumbers[i]; //printf("%d%c", temp, (i + 1) % colnum == 0?'\n':'\t'); } if (tempnumbers != NULL) free(tempnumbers); while (true) { system("clear"); for (int i = 0; i < maxnum; i++) printf("%d%c", randnumbers[i], (i + 1) % colnum == 0?'\n':'\t'); printf("move number/ invalid num==exit: "); int i; if (!scanf("%d", &i)) { printf("game over\n"); break; } if (i >= maxnum || i <0) { printf("sorry, i can't find %d\n", i); break; } unsigned char sign = abs(numbers[i] - numbers[0]); switch (sign) { case 1: case 4: swap(&numbers[0], &numbers[i]); break; } } if (numbers != NULL) free(numbers); if (randnumbers != NULL) free(randnumbers); } void swap(int **a, int **b) { int *templocation = *a; int tempvalue = **a; **a = **b; **b = tempvalue; *a = *b; *b = templocation; } int* initnumbers(void) { int *numbers = malloc(maxnum * sizeof(int)); for (int i = 0; i < maxnum; i++) numbers[i] = i; return numbers; } int getnumber(int **numbers, int randIndex, int *length) { int result = (*numbers)[randIndex]; (*numbers)[randIndex] = (*numbers)[--(*length)]; int *temp = realloc(*numbers, (*length) * sizeof(int)); *numbers = temp; return result; } bool _numexists(int *numbers, int start, int end, int num) { printf("start: %d, end: %d, num: %d\n", start, end, num); if (start == end) return numbers[start] == num; else { int middle = (start+end) / 2; if (numbers[middle] == num) return true; else if (numbers[middle] > num) return _numexists(numbers, start, middle-1, num); else return _numexists(numbers, middle+1, end, num); } } bool numexists(int *numbers, int length, int num) { return _numexists(numbers, 0, length-1, num); }
希望本文對(duì)大家學(xué)習(xí)C++程序設(shè)計(jì)有所幫助。
相關(guān)文章
C++實(shí)現(xiàn)插入排序?qū)φ麛?shù)數(shù)組排序
這篇文章主要為大家詳細(xì)介紹了C++實(shí)現(xiàn)插入排序?qū)φ麛?shù)數(shù)組排序,文中示例代碼介紹的非常詳細(xì),具有一定的參考價(jià)值,感興趣的小伙伴們可以參考一下2020-05-05c++類的隱式轉(zhuǎn)換與強(qiáng)制轉(zhuǎn)換重載詳解
轉(zhuǎn)換函數(shù)的名稱是類型轉(zhuǎn)換的目標(biāo)類型,因此,不必再為它指定返回值類型;轉(zhuǎn)換函數(shù)是被用于本類型的數(shù)值或變量轉(zhuǎn)換為其他的類型,也不必帶參數(shù)2013-09-09在輸入輸出字符串時(shí)scanf(),printf()和gets(),puts()的區(qū)別淺談
在輸入輸出字符串時(shí)scanf(),printf()和gets(),puts()的區(qū)別淺談,需要的朋友可以參考一下2013-02-02c語言循環(huán)加數(shù)組實(shí)現(xiàn)漢諾塔問題
本文主要介紹了c語言循環(huán)加數(shù)組實(shí)現(xiàn)漢諾塔問題,文中通過示例代碼介紹的非常詳細(xì),具有一定的參考價(jià)值,感興趣的小伙伴們可以參考一下2022-01-01