anybody know how to solve the question?# Computation - 科学计算
j*a
1 楼
You work at a company that works for internet-related technologies based
products, and your current project is a spam filter. This filter determines
whether or not a string contains spam-like information using a "spam-words-
dictionary" (SWD). If an input string contains at least one word from this
dictionary as a substring, the filter considers it to be spam-suspicious. (
Note: an entire string is considered a substring of itself.) You've decided
to solve a more challenging problem: how many un
products, and your current project is a spam filter. This filter determines
whether or not a string contains spam-like information using a "spam-words-
dictionary" (SWD). If an input string contains at least one word from this
dictionary as a substring, the filter considers it to be spam-suspicious. (
Note: an entire string is considered a substring of itself.) You've decided
to solve a more challenging problem: how many un
