Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
70 changes: 70 additions & 0 deletions 5/advanced_balance.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
#include "stack.h"

void main() {
char string[200] = {' '};

fgets(string, sizeof(string), stdin);
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

что-то не так с форматированием, во всей программе

Stack stack;
init(&stack);

int res = 1;

for (int i = 0; i < 200; i++) {
if (string[i] == '\n') {
break;
}
else if ((string[i] == '(') || (string[i] == '[') || (string[i] == '{')) {
push(&stack, string[i]);
}

else if (string[i] == ')') {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

а можно ли каждую скобку не раскопировать?

Node* pope = pop(&stack);
if (pope == NULL) {
res = 0;
break;
}
char popChar = (*pope).value;
if (popChar != '(') {
free(pope);
res = 0;
break;
}
}

else if (string[i] == ']') {
Node* pope = pop(&stack);
if (pope == NULL) {
res = 0;
break;
}
char popChar = (*pope).value;
if (popChar != '[') {
free(pope);
res = 0;
break;
}
}

else if (string[i] == '}') {
Node* pope = pop(&stack);
if (pope == NULL) {
res = 0;
break;
}
char popChar = (*pope).value;
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

pope->value

if (popChar != '{') {
free(pope);
res = 0;
break;
}
}
}

if (res == 0 || stack.size != 0) {
printf("Баланса нет\n");
}
else {
printf("Баланс есть\n");
}
}

46 changes: 46 additions & 0 deletions 5/stack.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
#include "stack.h"


void init(Stack* stack) {
(*stack).top = NULL;
(*stack).size = 0;
}

void push(Stack* stack, char value) {
Node* new_node = malloc(sizeof(Node));

(*new_node).value = value;
(*new_node).next = (*stack).top;

(*stack).top = new_node;
(*stack).size++;
}



Node* pop(Stack* stack) {
if ((*stack).top == NULL) {
return NULL;
}

Node* out = (*stack).top;
(*stack).top = (*out).next;

(*stack).size--;

return out;
}

void printStack(Stack* stack) {
if ((*stack).size == 0) {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

починить это везде, как я написал выше

printf("\n");
return;
}
Node* current = (*stack).top;
do {
printf("%c ", (*current).value);
current = (*current).next;
}
while (current != NULL);
printf("\n");
}
18 changes: 18 additions & 0 deletions 5/stack.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
#include <stdlib.h>
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

нет include guards

#include <stdio.h>

typedef struct Node {
char value;
struct Node* next;
} Node;

typedef struct Stack {
Node* top;
int size;
} Stack;


void init(Stack* stack);
void push(Stack* stack, char value);
Node* pop(Stack* stack);
void printStack(Stack* stack);