题解 | #字符串字符匹配#
字符串字符匹配
https://www.nowcoder.com/practice/22fdeb9610ef426f9505e3ab60164c93
#include <stdio.h> int main() { int arr1[26] = { 0 }; int arr2[26] = { 0 }; char ch = 0; while ((ch=getchar()) != '\n') { if(!arr1[(int)(ch - 'a')]) arr1[(int)(ch - 'a')]++; } while ((ch = getchar()) != '\n') { if (!arr2[(int)(ch - 'a')]) arr2[(int)(ch - 'a')]++; } int i = 0; for (; i < 26; i++) { if (arr1[i] != arr2[i] && arr1[i] != 0) { printf("false\n"); break; } } if (i == 26) { printf("true\n"); } return 0; }