Time Complexity Difference between Two Parsing Implementations Using Global Variables and Return Values

Question

I\'m trying to solve the following problem:

A string containing only lower-case letters can be encoded into NUM[encoded string] format. For example,