既有适合小白学习的零基础资料,也有适合3年以上经验的小伙伴深入学习提升的进阶课程,涵盖了95%以上C C++开发知识点,真正体系化!
由于文件比较多,这里只是将部分目录截图出来,全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频,并且后续会持续更新
for (int j = 0, num = i; j <= len; j++)
{
if (i == 0 || j == 0 || i == width || j == len)
map[i][j] = '#';
if ((i > 1 && i < width) && (j == mid - 1 || j == right - 1))
map[i][j] = '|';
if (num && (i >= 1 && i <= width - 1) && j % 2 != 0 && j < mid)
{
map[i][j] = -95;
map[i][j + 1] = -10; //打印 ■ ■占2个字节可以拆开来
num--;
}
}
}
gotoxy(0, 0); //容易出现东西卡顿
for (int i = 0; i <= width; i++)
{
for (int j = 0; j <= len; j++)
printf("%c", map[i][j]);
printf("\n");
}
return n;
}
void play(int x, int y)
{
int turn_0, n = 0, i, j, k, tx, ty, flag = 0;
if ((x == mid && y == right) || (x == left && y == mid) || (x == left && y == right))
turn_0 = 0; //往右
else if ((x == mid && y == left) || (x == right && y == left) || (x == right && y == mid))
turn_0 = 1; //往左
for (i = 1, j = y; i <= width; i++)
{ //目的地
if (map[i][j] != 0)
{
tx = i - 1;
ty = j;
break;
}
}
for (i = 1, j = x; i <= width; i++)
{ //出发点
if (map[i][j] != 0)
{
break;
}
}
while (1)
{
while ((i != 1 || j != x) && (i != 1 || j != y) && (i != tx || j != ty))
{
if (turn_0 == 0)
for (k = mid - 3; k >= 0; k–)
{
map[i + next[turn[turn_0][n]][0]][j + next[turn[turn_0][n]][1] + k] = map[i][j + k];
map[i][j + k] = 0;
}
else
for (k = 0; k < mid - 2; k++)
{
map[i + next[turn[turn_0][n]][0]][j + next[turn[turn_0][n]][1] + k] = map[i][j + k];
map[i][j + k] = 0;
}
gotoxy(j, i);
Sleep(time);
for (k = 0; k < mid - 2; k++)
{
printf(" “);
}
i = i + next[turn[turn_0][n]][0];
j = j + next[turn[turn_0][n]][1];
gotoxy(j, i);
Sleep(time);
for (k = 0; k < mid - 2; k++)
{
printf(”%c", map[i][j + k]);
}
}
n++; //改变方向;
if (i == tx && j == ty)
return;
if (turn_0 == 0)
for (k = mid - 3; k >= 0; k–)
{
map[i + next[turn[turn_0][n]][0]][j + next[turn[turn_0][n]][1] + k] = map[i][j + k];
map[i][j + k] = 0;
}
else
for (k = 0; k < mid - 2; k++)
{
map[i + next[turn[turn_0][n]][0]][j + next[turn[turn_0][n]][1] + k] = map[i][j + k];
map[i][j + k] = 0;
}
gotoxy(j, i);
for (k = 0; k < mid - 2; k++)
{
printf(" “);
}
Sleep(time);
i = i + next[turn[turn_0][n]][0];
j = j + next[turn[turn_0][n]][1];
gotoxy(j, i);
for (k = 0; k < mid - 2; k++)
printf(”%c", map[i][j + k]);
Sleep(time);
}
}
void move(int a, int b, int c, char aa, char bb, char cc, int n)
{
if (n == 1)
{
gotoxy(0, width + 1);
printf(“from %c to %c”, aa, cc);
play(a, c);
return;
}
move(a, c, b, aa, cc, bb, n - 1);
gotoxy(0, width + 1);
网上学习资料一大堆,但如果学到的知识不成体系,遇到问题时只是浅尝辄止,不再深入研究,那么很难做到真正的技术提升。
一个人可以走的很快,但一群人才能走的更远!不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人,都欢迎加入我们的的圈子(技术交流、学习资源、职场吐槽、大厂内推、面试辅导),让我们一起学习成长!
bbs.csdn.net/topics/618668825)**
一个人可以走的很快,但一群人才能走的更远!不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人,都欢迎加入我们的的圈子(技术交流、学习资源、职场吐槽、大厂内推、面试辅导),让我们一起学习成长!