查找模式是否在两个字符串中的任何一个中的最短方法

Question

I have a pattern that I need to know (by returning a boolean ) if is contained in any of two strings, and I want to know how to do this in the shortest way possible.

I know I can use any() for larger amounts of strings but I was looking for the shortest way to accomplish this for string pairs , because using any() would require list comprehension at the very least.

I was expecting something like this, but it does not work:

pattern in (string1 or string2)

I was getting confused because this code actually works for string1 , but it only checks string2 if string1 is False or None (I think).

Ultimately I can use any((pattern in s for s in (string1, string2))) , but it's less pretty or readable inside the code.

Answer 1

I think there's no nitpicks. Just do the most intuitive:

has_pattern = pattern in string1 or pattern in string2

Note that (string1 or string2) is almost always wrong by your intention, as the result of that expression is string1 if it's non-empty, and string2 otherwise.