No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
Hey everyone, I am a beginner at python, and on these forums (even though I have lurked here quite a bit). Anyway, I really need some help with recursive functions. I don't exactly know how they work, and I have to be able to answer the following questions: [code] Turn … |
|
I need to do the following question: [code]Turn a line of input containing matching pairs of round (()) or curly ({}) brackets into a mountain range. The height of the mountain should indicate how deeply nested the brackets are. For example, given this input: {({(){}()}{(){}()})({(){}()}{(){}()})({(){}()}{(){}()})} Your program should output: (){}() … |