topic description
sources of topics and their own ideas
related codes
/ / Please paste the code text below (do not replace the code with pictures)
string
- A1, B1, C1, C1, C2, B2, A2, D1, D2, D3
- E1, E2, E3, F1, F2, F3
string type: each TOKEN in the string is alphanumeric. You need to do a function processing on the string to get the following result. In the
question, there are only two strings that conform to the above rules, and the strings that conform to the above rules are infinite.
string 1 result:
A--> {A1 recorder A2}
B--> {B1J B2}
C--> {C1J C2}
DLV-> {D1 Magi D2 D3}
string 2 result:
E--> {E1Part E2 E3}
F-> {F1Pert F2 F3}
