anonymous
  • anonymous
My version of the answers to Problem Set 3. Please note that I might have diverted slightly of what might have been asked in the question. I adjusted my algorithm for those cases where close matches were being sought for single letter strings. Hope this helps
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
Problem Set 3 (Part I - Part IV)
anonymous
  • anonymous
Hi chribonn, I have a question regarding the function subStringMatchExact. In its second to last line, there's LastPos = str.find(target, key, LastPos + 1). Instead of the 3rd argument "LastPos+1", the argument "LastPos+len(key)" also works if I just use the function subStringMatchExact on its own. But if I call this function from some other function like subStringMatchOneSub, it takes forever to run. In that case, "LastPos+len(key)" doesn't work. Is there any explanation for why this happens? Thank you! btw your idea of using addUnique was really great. thanks again. :)

Looking for something else?

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