既有适合小白学习的零基础资料,也有适合3年以上经验的小伙伴深入学习提升的进阶课程,涵盖了95%以上C C++开发知识点,真正体系化!
由于文件比较多,这里只是将部分目录截图出来,全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频,并且后续会持续更新
void playerMove(char chessBoard[MAX_ROW][MAX_COL]){
while (1){
int row = 0;
int col = 0;
printf(“请输入坐标(row col):”);
scanf(“%d %d”, &row, &col);
if (row < 0 || row >= MAX_ROW || col < 0 || col >= MAX_COL){
printf(“您的坐标不在合法范围内 [0, 2],请重新输入:\n”);
continue;
}
if (chessBoard[row][col] != ’ '){
printf(“您的坐标位置已经有子了!\n”);
continue;
}
chessBoard[row][col] = ‘x’;
break;
}
}
### 6.电脑落子
电脑随机产生行列坐标,'o’表示电脑落子。
注意:
1.要在主函数中使用`srand((unsigned int)time(0))`
将时间作为随机数种子,确保得到的行列坐标是真随机。
2.要在棋盘上空的地方下棋。
void computerMove(char chessBoard[MAX_ROW][MAX_COL]){
while (1){
int row = rand() % MAX_ROW;
int col = rand() % MAX_COL;
if (chessBoard[row][col] != ’ ') {
continue;
}
chessBoard[row][col] = ‘o’;
break;
}
}
### 7.判断胜负
此处约定返回结果的含义:
(1)‘x’ 表示玩家获胜
(2)‘o’ 表示电脑获胜
(3)’ ’ 表示胜负未分
(4) ‘q’ 表示和棋
1.判定是否和棋
(1)调用isFull函数。
(2)如果数组中有元素为’ ‘,那么没满,返回0。如果全不为’ ',满了,返回1。
(3)如果棋盘满了未分出胜负,和棋。
2.判定电脑玩家胜利
(1)判定所有的行
(2)判定所有的列
(3)判定两条对角线
int isFull(char chessBoard[MAX_ROW][MAX_COL]){
for (int row = 0; row < MAX_ROW; row++){
for (int col = 0; col < MAX_COL; col++){
if (chessBoard[row][col] == ’ '){
return 0;
}
}
}
return 1;
}
char isWin(char chessBoard[MAX_ROW][MAX_COL]){
for (int row = 0; row < MAX_ROW; row++) {
if (chessBoard[row][0] != ’ ’
&& chessBoard[row][0] == chessBoard[row][1]
&& chessBoard[row][0] == chessBoard[row][2]) {
return chessBoard[row][0];
}
}
for (int col = 0; col < MAX_COL; col++) {
if (chessBoard[0][col] != ’ ’
&& chessBoard[0][col] == chessBoard[1][col]
&& chessBoard[0][col] == chessBoard[2][col]) {
return chessBoard[0][col];
}
}
if (chessBoard[0][0] != ’ ’
&& chessBoard[0][0] == chessBoard[1][1]
&& chessBoard[0][0] == chessBoard[2][2]) {
return chessBoard[0][0];
}
if (chessBoard[2][0] != ’ ’
&& chessBoard[2][0] == chessBoard[1][1]
&& chessBoard[2][0] == chessBoard[0][2]) {
return chessBoard[2][0];
}
if (isFull(chessBoard)) {
return ‘q’;
}
return ’ ';
}
## 四、结果演示
### 1.玩家胜利
![在这里插入图片描述](https://img-blog.csdnimg.cn/20201101133058298.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM0MjcwODc0,size_16,color_FFFFFF,t_70#pic_center)
### 2.电脑胜利
![在这里插入图片描述](https://img-blog.csdnimg.cn/20201101134712504.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM0MjcwODc0,size_16,color_FFFFFF,t_70#pic_center)
### 3.和棋
![在这里插入图片描述](https://img-blog.csdnimg.cn/20201101134902695.png#pic_center)
## 五、代码实现
#define _CRT_SECURE_NO_WARNINGS
#define MAX_ROW 3
#define MAX_COL 3
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void init(char chessBoard[MAX_ROW][MAX_COL]){
for (int row = 0; row < MAX_ROW; row++){
for (int col = 0; col < MAX_COL; col++){
chessBoard[row][col] = ’ ';
}
}
}
void print_chessBoard(char chessBoard[MAX_ROW][MAX_COL]){
printf(“±–±–±–+\n”);
for (int row = 0; row <MAX_ROW; row++) {
printf(“| %c | %c | %c |\n”, chessBoard[row][0],
chessBoard[row][1], chessBoard[row][2]);
printf(“±–±–±–+\n”);
}
}
void playerMove(char chessBoard[MAX_ROW][MAX_COL]){
while (1){
int row = 0;
int col = 0;
printf(“请输入坐标(row col):”);
scanf(“%d %d”, &row, &col);
if (row < 0 || row >= MAX_ROW || col < 0 || col >= MAX_COL){
printf(“您的坐标不在合法范围内 [0, 2],请重新输入:\n”);
continue;
}
if (chessBoard[row][col] != ’ '){
printf(“您的坐标位置已经有子了!\n”);
continue;
}
chessBoard[row][col] = ‘x’;
break;
}
}
void computerMove(char chessBoard[MAX_ROW][MAX_COL]){
while (1){
int row = rand() % MAX_ROW;
int col = rand() % MAX_COL;
if (chessBoard[row][col] != ’ ') {
continue;
}
chessBoard[row][col] = ‘o’;
break;
}
}
int isFull(char chessBoard[MAX_ROW][MAX_COL]){
for (int row = 0; row < MAX_ROW; row++){
for (int col = 0; col < MAX_COL; col++){
if (chessBoard[row][col] == ’ '){
return 0;
}
}
}
return 1;
}
char isWin(char chessBoard[MAX_ROW][MAX_COL]){
for (int row = 0; row < MAX_ROW; row++) {
if (chessBoard[row][0] != ’ ’
&& chessBoard[row][0] == chessBoard[row][1]
&& chessBoard[row][0] == chessBoard[row][2]) {
return chessBoard[row][0];
}
}
for (int col = 0; col < MAX_COL; col++) {
if (chessBoard[0][col] != ’ ’
&& chessBoard[0][col] == chessBoard[1][col]
&& chessBoard[0][col] == chessBoard[2][col]) {
return chessBoard[0][col];
}
}
if (chessBoard[0][0] != ’ ’
&& chessBoard[0][0] == chessBoard[1][1]
&& chessBoard[0][0] == chessBoard[2][2]) {
return chessBoard[0][0];
}
if (chessBoard[2][0] != ’ ’
&& chessBoard[2][0] == chessBoard[1][1]
&& chessBoard[2][0] == chessBoard[0][2]) {
return chessBoard[2][0];
}
if (isFull(chessBoard)) {
return ‘q’;
}
return ’ ';
}
void game(){
char chessBoard[MAX_ROW][MAX_COL] = { 0 };
init(chessBoard);
char winner = ’ ';
while (1){
system(“cls”);
print_chessBoard(chessBoard);
playerMove(chessBoard);
winner = isWin(chessBoard);
if (winner != ’ ') {
break;
}
computerMove(chessBoard);
winner = isWin(chessBoard);
if (winner != ’ ') {
break;
}
}
print_chessBoard(chessBoard);
if (winner == ‘x’) {
printf(“恭喜您, 您赢了!\n”);
}
else if (winner == ‘o’) {
printf(“哈哈,您连人工智障都下不过!\n”);
}
else {
printf(“您只能和人工智障打平手!!\n”);
}
}
int menu(){
printf(“--------------------------\n”);
printf(“--------1.开始游戏--------\n”);
printf(“--------0.退出游戏--------\n”);
printf(“--------------------------\n”);
int choice = 0;
printf(“请输入你的选择:”);
scanf(“%d”, &choice);
return choice;
}
int main()
{
srand((unsigned int)time(0));
while (1){
int choice = menu();
if (choice == 1){
game();
}
else if (choice == 0){
printf(“退出游戏,GOODBYE!!!\n”);
break;
}
else{
printf(“输入错误!请重新输入!\n”);
continue;
}
}
网上学习资料一大堆,但如果学到的知识不成体系,遇到问题时只是浅尝辄止,不再深入研究,那么很难做到真正的技术提升。
一个人可以走的很快,但一群人才能走的更远!不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人,都欢迎加入我们的的圈子(技术交流、学习资源、职场吐槽、大厂内推、面试辅导),让我们一起学习成长!
g-pWN1iA2b-1715549128386)]
[外链图片转存中…(img-sWx2008D-1715549128386)]
网上学习资料一大堆,但如果学到的知识不成体系,遇到问题时只是浅尝辄止,不再深入研究,那么很难做到真正的技术提升。
一个人可以走的很快,但一群人才能走的更远!不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人,都欢迎加入我们的的圈子(技术交流、学习资源、职场吐槽、大厂内推、面试辅导),让我们一起学习成长!