ik528ny/pvjc26
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

123

Browse Source
This commit is contained in:
Illia Korpan 2026-04-15 08:53:37 +02:00
parent e427770150
commit 41d3726c02
1 changed files with 2 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
du4/snake.c
View File

@ -16,20 +16,17 @@ struct snake* remove_snake(struct snake* snake){
if (snake == NULL) { if (snake == NULL) {
return NULL; return NULL;
} }
// If snake has only one part
if (snake->next == NULL) { if (snake->next == NULL) {
free(snake); free(snake);
return NULL; return NULL;
} }
// Find the second-to-last part
struct snake* current = snake; struct snake* current = snake;
while (current->next->next != NULL) { while (current->next->next != NULL) {
current = current->next; current = current->next;
} }
// Free the last part
free(current->next); free(current->next);
current->next = NULL; current->next = NULL;
@ -58,13 +55,10 @@ int is_snake(struct snake* snake, int x, int y){
int step_state(struct state* st){ int step_state(struct state* st){
int nx = (st->snake->x + st->sx); int nx = (st->snake->x + st->sx);
int ny = (st->snake->y + st->sy); int ny = (st->snake->y + st->sy);
// Check if new position is on the wall
if (nx < 0 || nx >= st->width || ny < 0 || ny >= st->height) { if (nx < 0 || nx >= st->width || ny < 0 || ny >= st->height) {
return END_WALL; return END_WALL;
} }
// Check if new position is on the snake (excluding the head)
struct snake* current = st->snake->next; struct snake* current = st->snake->next;
while (current != NULL) { while (current != NULL) {
if (current->x == nx && current->y == ny) { if (current->x == nx && current->y == ny) {
@ -73,7 +67,6 @@ int step_state(struct state* st){
current = current->next; current = current->next;
} }
// Check if new position is on food
int food_index = -1; int food_index = -1;
for (int i = 0; i < FOOD_COUNT; i++) { for (int i = 0; i < FOOD_COUNT; i++) {
if (st->foodx[i] == nx && st->foody[i] == ny) { if (st->foodx[i] == nx && st->foody[i] == ny) {
@ -83,13 +76,10 @@ int step_state(struct state* st){
} }
if (food_index != -1) { if (food_index != -1) {
// Mark food as eaten
st->foodx[food_index] = -1; st->foodx[food_index] = -1;
st->foody[food_index] = -1; st->foody[food_index] = -1;
// Add new snake part at food position
st->snake = add_snake(st->snake, nx, ny); st->snake = add_snake(st->snake, nx, ny);
// Check if there is any food left
int food_left = 0; int food_left = 0;
for (int i = 0; i < FOOD_COUNT; i++) { for (int i = 0; i < FOOD_COUNT; i++) {
if (st->foodx[i] >= 0) { if (st->foodx[i] >= 0) {
@ -104,7 +94,6 @@ int step_state(struct state* st){
return END_CONTINUE; return END_CONTINUE;
} }
// Normal move: add new head and remove tail
st->snake = add_snake(st->snake, nx, ny); st->snake = add_snake(st->snake, nx, ny);
st->snake = remove_snake(st->snake); st->snake = remove_snake(st->snake);