66_plusOne.py

#You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.

#Increment the large integer by one and return the resulting array of digits.
class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        newNumber = ""
        for i in digits:
            newNumber += str(i)
        newNumber2 = str(int(newNumber)+1)
        return [int(x) for x in newNumber2]