-
Notifications
You must be signed in to change notification settings - Fork 0
/
ransom.c
179 lines (126 loc) · 3.5 KB
/
ransom.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* readline();
char** split_string(char*);
typedef struct node_t {
char *word; // word is the actual word in the magazine/ note.
int count;
struct node_t *next;
struct node_t *prev;
} node_t;
typedef struct list_t {
node_t *head;
node_t *tail;
} list_t;
node_t *create_node(char** text, int index);
list_t create_lists(int text_count, char **text);
// Complete the checkMagazine function below.
void checkMagazine(int magazine_count, char** magazine, int note_count, char** note) {
if (magazine_count < note_count){
printf("No");
return;
}
list_t magazine_list = create_list(magazine_count, magazine);
list_t note_list = create_list(note_count, note);
compare_lists(magazine_list, note_list);
// free all nodes
}
list_t create_lists(int text_count, char **text){
list_t list;
for (int i=0; i < text_count; i++){
if (i = 0) {
list->head = create_node(text[i]);
list->tail = list->head;
} else {
node_t *current_node = word_exist(text[i]);
if(current_node != NULL){
current_node->count++;
} else {
list->tail = current_node;
current_node->prev = temp_prev;
}
}
}
return list;
}
node_t *create_node(char *word) {
node_t *node = (node_t *) malloc(sizeof(node_t));
}
int main()
{
char** mn = split_string(readline());
char* m_endptr;
char* m_str = mn[0];
int m = strtol(m_str, &m_endptr, 10);
if (m_endptr == m_str || *m_endptr != '\0') { exit(EXIT_FAILURE); }
char* n_endptr;
char* n_str = mn[1];
int n = strtol(n_str, &n_endptr, 10);
if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }
char** magazine_temp = split_string(readline());
char** magazine = malloc(m * sizeof(char*));
for (int i = 0; i < m; i++) {
char* magazine_item = *(magazine_temp + i);
*(magazine + i) = magazine_item;
}
int magazine_count = m;
char** note_temp = split_string(readline());
char** note = malloc(n * sizeof(char*));
for (int i = 0; i < n; i++) {
char* note_item = *(note_temp + i);
*(note + i) = note_item;
}
int note_count = n;
checkMagazine(magazine_count, magazine, note_count, note);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!line) {
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = '\0';
data = realloc(data, data_length);
} else {
data = realloc(data, data_length + 1);
data[data_length] = '\0';
}
return data;
}
char** split_string(char* str) {
char** splits = NULL;
char* token = strtok(str, " ");
int spaces = 0;
while (token) {
splits = realloc(splits, sizeof(char*) * ++spaces);
if (!splits) {
return splits;
}
splits[spaces - 1] = token;
token = strtok(NULL, " ");
}
return splits;
}