Question

solve with python

Write a recursive function recStringWithLenCount() that takes a one-dimensional list of strings as a parameter and returns the count of strings that have at least the length of second parameter passed into the function that are found in the list. Recall that you can determine whether an item is a string by writing type(item) == str. The only list functions you are allowed to use are len(), indexing (lst[i] for an integer i), or slicing (lst[i:j] for integers i and j). In particular, the function should not in any way alter the list passed as a parameter. The following shows several sample runs of the function:

Answer 1

(no subject)

$me?at=AF6bupOUkgBB_XCs1tzLUTIwi7GRCb7D_A$

Vamsi Saikam

to me
0 minutes ago

Details

def recStringWithLenCount(lst,length):
if len(lst)==0:
return 0
if type(lst[0])==str:
if length<=len(lst[0]):
return recStringWithLenCount(lst[1:],length)+1
return recStringWithLenCount(lst[1:],length)
#testing above method
print(recStringWithLenCount(['Anthony'],2))
print(recStringWithLenCount(['ab','cd'],2))
print(recStringWithLenCount(['ab','cd'],1))
print(recStringWithLenCount(['ab','cd'],3))
print(recStringWithLenCount([],3))

main.py 1. def recStringWithLenCount(1st, length if len(1st)==0: return 0 if type(lst[@])==str: if length<=len(1st[@]): return recStringWithLencount(1st[1:], length)+1 return recStringWithLenCount(1st[1:], length), 8 #testing above method 9 print(recStringWithLencount(['Anthony'], 2)) 10 print(recStringWithLencount(['ab', 'cd'1,2)) 11 print(recStringWithLenCount(['ab', 'cd'],1)), 12 print(recStringWithLencount(['ab', 'cd'],3) 13 print(recStringWithLencount([],3) min on input ...Program finished with exit code o Press ENTER to exit console.