ada/prog.l_ada
1
0
Fork 0
mirror of https://github.com/ada-dmitry/prog.l_ada.git synced 2026-09-24 09:10:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

dir.main added

Browse Source
This commit is contained in:
ada-dmitry
2023-04-25 08:05:41 +03:00
parent 62d99ba675
commit 1f8e90cb3d
37 changed files with 1018 additions and 321 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Home/PL/HW/array_xor/func.c
+43 -25
View File
@@ -1,16 +1,20 @@
#include "header.h"
void node_print(Node* n) {
while (n != NULL) {
void node_print(Node *n)
{
while (n != NULL)
{
printf("%s\n", n->name);
n = n->next;
}
}
Node* add_tail(Node* n, char s[]) {
if (n == NULL) {
if ((n = malloc(sizeof(Node))) == NULL) {
Node *add_tail(Node *n, char s[])
{
if (n == NULL)
{
if ((n = malloc(sizeof(Node))) == NULL)
{
printf("could not malloc\n");
exit(1);
}
@@ -19,51 +23,62 @@ Node* add_tail(Node* n, char s[]) {
memcpy(n->name, s, LEN);
return n;
}
if (!strcmp(n->name, "\0")) {
if (!strcmp(n->name, "\0"))
{
memcpy(n->name, s, LEN);
n->next = NULL;
n->prev = NULL;
return n;
}
Node* res = n;
while (n->next != NULL) n = n->next;
Node* tmp = malloc(sizeof(Node));
Node *res = n;
while (n->next != NULL){
printf("%p\n", n);
n = n->next;
}
Node *tmp = malloc(sizeof(Node));
memcpy(tmp->name, s, LEN);
tmp->prev = n;
n->next = tmp;
return res;
}
Node get(Node* node, int n) {
Node get(Node *node, int n)
{
int i;
for (i = 0; i < n; i++) {
for (i = 0; i < n; i++)
{
node = node->next;
}
return *node;
}
int len(Node* n) {
int len(Node *n)
{
int res = 0;
while (n != NULL) {
while (n != NULL)
{
res++;
n = n->next;
}
return res;
}
Node* xor_find(Node* n1, Node* n2) {
Node *xor_find(Node *n1, Node *n2)
{
int i, j, f = 0;
Node* res = NULL;
if ((res = malloc(sizeof(Node))) == NULL) {
Node *res = NULL;
if ((res = malloc(sizeof(Node))) == NULL)
{
printf("could not malloc\n");
exit(3);
}
for (i = 0; i < len(n1); i++) {
for (j = 0; j < len(n2); j++) {
if (strcmp(get(n1, i).name, get(n2, j).name) == 0) {
for (i = 0; i < len(n1); i++)
{
for (j = 0; j < len(n2); j++)
{
if (strcmp(get(n1, i).name, get(n2, j).name) == 0)
{
f = 1;
}
}
@@ -72,9 +87,12 @@ Node* xor_find(Node* n1, Node* n2) {
f = 0;
}
for (i = 0; i < len(n2); i++) {
for (j = 0; j < len(n1); j++) {
if (strcmp(get(n2, i).name, get(n1, j).name) == 0) {
for (i = 0; i < len(n2); i++)
{
for (j = 0; j < len(n1); j++)
{
if (strcmp(get(n2, i).name, get(n1, j).name) == 0)
{
f = 1;
}
}