PlusOne.py

# 66. Plus One
# Easy
# 8.7K
# 5.3K
# Companies
# 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.

 

# Example 1:

# Input: digits = [1,2,3]
# Output: [1,2,4]
# Explanation: The array represents the integer 123.
# Incrementing by one gives 123 + 1 = 124.
# Thus, the result should be [1,2,4].
# Example 2:

# Input: digits = [4,3,2,1]
# Output: [4,3,2,2]
# Explanation: The array represents the integer 4321.
# Incrementing by one gives 4321 + 1 = 4322.
# Thus, the result should be [4,3,2,2].
# Example 3:

# Input: digits = [9]
# Output: [1,0]
# Explanation: The array represents the integer 9.
# Incrementing by one gives 9 + 1 = 10.
# Thus, the result should be [1,0].
 

# Constraints:

# 1 <= digits.length <= 100
# 0 <= digits[i] <= 9
# digits does not contain any leading 0's.
# Accepted
# 2M
# Submissions
# 4.5M

class Solution(object):
    def plusOne(self, digits):
        
        workaround = int("".join((map(str,digits))))

        workaround += 1

        return [int(digit) for digit in str(workaround)]
    

# for this problem we need to join all our elements together, add one, then split them back up. in javascript this is a much simpler
# task than in python. python requires us to change from int to str and back here quite often to be able to perform our task. 
# we also need to use a map method in order to add each one individualy to our list.