Recursive Python solution (98.87%% Speed 100% Memory)
While this can be solved with a one liner, I thought that it was also a good candidate for a simple little soliution that modfiies the values in the list withou
While this can be solved with a one liner, I thought that it was also a good candidate for a simple little soliution that modfiies the values in the list without converting to different formats etc. Uses recursion to deal with adding 1 to 9.\n```python\nclass Solution:\n    def plusOne(self, digits: List[int]) -> List[int]:\n        if digits[-1] < 9:\n            digits[-1] += 1\n            return digits\n        elif len(digits) == 1 and digits[0] == 9:\n            return [1, 0]\n        else:\n            digits[-1] = 0\n            digits[0:-1] = self.plusOne(digits[0:-1])\n            return digits\n```
['Recursion', 'Python', 'Python3']