|
I do n’t know if your question involves string manipulation. If this is the case, I have an idea:
1. Suppose you have N strings, they are the same, but we can find a signature for them. In the example in this article, we can think of "a * b + a * c" as their signature.
2. Convert all the strings according to a certain strategy. If their conversion result and label are consistent, they are considered equivalent, otherwise they are not equivalent.
The idea is to find inspiration from the algorithms that look for "anagrams". You can search for the specific algorithm. |
|