Need some hints for Problem Set 3 Problem 4. I'm not quite sure where to start. How do I decide on which character of key will be omitted from the search? If I have to check all possible omissions, how's that done? The functions from problem 2 and 3 depended on inputting the beginning and end of a string missing a particular character; they didn't dynamically take a key and break it down.
MIT 6.00 Intro Computer Science (OCW)
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
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.
Hi mtoyama, you would use the functions subStringMatchExact, and subStringMatchOneSub to construct your solution to problem 4. Within subStringMatchOneSub, there is code to dynamically break the key down. (e.g. key1=key[:miss] and key2=key[miss+1:]). The instruction said to use functions from problem 2 and 3, not just the ones that you wrote. In this case they were referring to the function subStringMatchOneSub that they provided.
Problem 4 can be rephrase to find all the indexes generated by subStringMatchOneSub that's not in indexes generated by subStringMatchExact
Whoops. Maybe I should've downloaded the supporting files. Thought I could get away without it - I'll grab them before I go to tackle P4. Thanks!