|
|
|
@ -1,28 +1,30 @@ |
|
|
|
int _fits(char* bottom, int len_bottom, char* top, int len_top) { |
|
|
|
int bottom_letters[26]; |
|
|
|
int top_letters[26]; |
|
|
|
int _fits(char * bottom, int len_bottom, char * top, int len_top) { |
|
|
|
int bottom_letters[26] = { |
|
|
|
0 |
|
|
|
}; |
|
|
|
int top_letters[26] = { |
|
|
|
0 |
|
|
|
}; |
|
|
|
int letter_val; |
|
|
|
int i; |
|
|
|
for (i = 0; i < len_bottom; i++) { |
|
|
|
letter_val = bottom[i]-96; |
|
|
|
letter_val = bottom[i] - 97; |
|
|
|
if (0 <= letter_val && letter_val <= 25) { |
|
|
|
bottom_letters[letter_val] += 1; |
|
|
|
} else { |
|
|
|
return 0; |
|
|
|
} |
|
|
|
else { |
|
|
|
return 1; |
|
|
|
} |
|
|
|
} |
|
|
|
for (i = 0; i < len_top; i++) { |
|
|
|
letter_val = top[i]-96; |
|
|
|
letter_val = top[i] - 97; |
|
|
|
if (0 <= letter_val && letter_val <= 25) { |
|
|
|
top_letters[letter_val] += 1; |
|
|
|
} else { |
|
|
|
return 0; |
|
|
|
} |
|
|
|
else { |
|
|
|
return 1; |
|
|
|
} |
|
|
|
} |
|
|
|
for (i = 0; i < 26; i++ ) { |
|
|
|
if (bottom_letters[i] < top_letters) { |
|
|
|
for (i = 0; i < 26; i++) { |
|
|
|
if (bottom_letters[i] < top_letters[i]) { |
|
|
|
return 0; |
|
|
|
} |
|
|
|
} |
|
|
|
|