anonymous
  • anonymous
I'm really having trouble with Problem 1 in set 3. I'm using the result of a find as my test in the recursive function but it's not working.
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
def recursion(target, key, ans=()): print find(target,key) if (find(target,key)) ==-1: return ans while find(target,key) != -1: ans += (len(target),) print ans recursion(target[find(target,key)+len(key):], key, ans) is what I'm using, but even when find(target,key) == -1, it still doesn't trigger the following if statement.
anonymous
  • anonymous
I'm using this as a recursive function within my solution. it's meant to return a tuple called ans that lists the successive lengths of the target string as it's shortened. from that I can determine the number of finds in the original string and their locations. I suspect there's a better way, but I'm not that bright.
anonymous
  • anonymous
nvm, I've got something I'm happier with.

Looking for something else?

Not the answer you are looking for? Search for more explanations.