Python | Check if string ends with any string in given list
Last Updated :
09 Feb, 2023
While working with strings, their prefixes and suffix play an important role in making any decision. For data manipulation tasks, we may need to sometimes, check if a string ends with any of the matching strings. Let’s discuss certain ways in which this task can be performed.
Method #1 : Using filter() + endswith() The combination of the above function can help to perform this particular task. The filter method is used to check for each word and endswith method tests for the suffix logic at target list.
Python3
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string :"+ str(test_string))
res = list(filter(test_string.endswith, suff_list)) != []
print("Does string end with any suffix list sublist ? :"+ str(res))
|
Output
The original string :GfG is best
Does string end with any suffix list sublist ? :True
Time Complexity : O(n)
Space Complexity : O(n)
Method #2 : Using endswith() As an improvement to the above method, it is not always necessary to include filter method for comparison. This task can be handled solely by supplying a suffix check list as an argument to endswith method as well.
Python3
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string :"+ str(test_string))
res = test_string.endswith(tuple(suff_list))
print("Does string end with any suffix list sublist ? :"+ str(res))
|
Output
The original string :GfG is best
Does string end with any suffix list sublist ? :True
Time Complexity : O(n)
Space Complexity : O(1)
Method #3 : Using split().Splitting the given string and comparing every string of list for matching suffix
Python3
res = False
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string : " + str(test_string))
x = test_string.split()
for i in suff_list:
if(x[-1] == i):
res = True
print("Does string end with any suffix list sublist ? : " + str(res))
|
Output
The original string : GfG is best
Does string end with any suffix list sublist ? : True
Time Complexity : O(n)
Space Complexity : O(1)
Method #4 : Using split() and in operator
Python3
res = False
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string : " + str(test_string))
x = test_string.split()
if x[-1] in suff_list:
res=True
print("Does string end with any suffix list sublist ? : " + str(res))
|
Output
The original string : GfG is best
Does string end with any suffix list sublist ? : True
Time Complexity : O(n)
Space Complexity : O(1)
Method #5 : Using find() and len() methods
Python3
res = False
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string : " + str(test_string))
for i in suff_list:
a = test_string.find(i)
b = len(test_string)-len(i)
if(a == b):
res = True
print("Does string end with any suffix list sublist ? : " + str(res))
|
Output
The original string : GfG is best
Does string end with any suffix list sublist ? : True
Time complexity: O(n * m)
Space complexity: O(1)
Method #6 : Using any()
The any function in Python returns True if any element in an iterable is True, and False otherwise. In this approach, we use a list comprehension to generate a list of boolean values, where each value is True if the test string ends with the current suffix in the list, and False otherwise. The any function is then used to check if any element in the list is True.
Python3
test_string = "GfG is best"
suffix_list = ['best', 'iss', 'good']
print("The original string :"+ str(test_string))
result = any(test_string.endswith(suffix) for suffix in suffix_list)
print("Does string end with any suffix list sublist ? :"+ str(result))
|
Output
The original string :GfG is best
Does string end with any suffix list sublist ? :True
Time complexity: O(n), where n is the length of the suffix list
Auxiliary space: O(1)
Method 7: using operator.countOf() method
Python3
import operator as op
res = False
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string : " + str(test_string))
x = test_string.split()
if op.countOf(suff_list, x[-1]) > 0:
res = True
print("Does string end with any suffix list sublist ? : " + str(res))
|
Output
The original string : GfG is best
Does string end with any suffix list sublist ? : True
Time Complexity: O(N)
Auxiliary Space : O(1)
Method 8: Using regular expressions
Python3
import re
test_string = "GfG is best"
suffix_list = ['best', 'iss', 'good']
print("The original string : " + str(test_string))
flag = False
for suffix in suffix_list:
match = re.search(r'{}$'.format(suffix), test_string)
if match:
flag = True
break
print("Does string end with any suffix list sublist ? : " + str(flag))
|
Output
The original string : GfG is best
Does string end with any suffix list sublist ? : True
Time Complexity: O(N)
Auxiliary Space : O(1)
Method#9: Using Recursive method.
Python3
def check_suffix(string, suffix_list):
if not string:
return False
words = string.split()
if not words:
return False
if words[-1] in suffix_list:
return True
return check_suffix(" ".join(words[:-1]), suffix_list)
res = False
test_string = "GfG is best"
suff_list = ['best', 'iss', 'good']
print("The original string : " + str(test_string))
res = check_suffix(test_string, suff_list)
print("Does string end with any suffix list sublist ? : " + str(res))
|
Output
The original string : GfG is best
Does string end with any suffix list sublist ? : True
Time Complexity: O(n)
Auxiliary Space: O(n)
Please Login to comment...