Pku acm 2159 computing ent cipher sorting algorithm solution report (6) -- count sorting

The question is very complex. In fact, as long as the types and times of letters in two strings are the same, the question is yes, for example:

JWPUDJSTVP----------11111122

Victorious--11111122

Six letters appear once and two letters appear twice.

In this way, it is converted to a simple sort. A1 [] is used to represent the characters in the first string,

A1 [1], A1 [2] indicates the number of times a B appears, and so on. A2 [] indicates the second string.

The characters A2 [1] and A2 [2] indicate the number of times a B appears, and so on.

Sort the rows and put the results in B1 and B2. Then, compare B1 [I] and B2 [I] to see if they are equal.

Yes; otherwise, no.

With detailed commentsCodeFromHttp://download.csdn.net/user/china8848/.