For algorithm

Very few such data:
1, A+B+C-D+
2, A+B-C+D-
3, C+A-B+E+
4, A+B+C-D-
....
The letter is in disorder.

Need to quickly find that data in the form of,
Contains
A+C-
The result is: 1
Or
(A+|B+)&C- resolution is needed to find: A+C- or B+C-, as long as one of them will find satisfaction,
Result:
1, A+B+C-D+
4, A+B+C-D-

For the algorithm, or ideas. . . .

Started by Mamie at November 18, 2016 - 3:30 AM

Can the structure of data, not to limit the data form, had better consider performance

Posted by Mamie at December 03, 2016 - 3:44 AM

Contains
A+C-
The result is: 1, 4

Posted by Mamie at December 04, 2016 - 4:03 AM

I thought: the string according to the A+, and then compare the segmentation, B+ format, this should be more efficient

Posted by Rod at December 05, 2016 - 4:42 AM