text: '''
  - Leetcode problem: 66
  
  - Difficulty: Easy
  
  - Brief problem description:
  
  Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
  
  The digits are stored such that the most significant digit is at the head of the list, and each element in the array
  contain a single digit.
  
  You may assume the integer does not contain any leading zero, except the number 0 itself.
  
  Example 1:
  
  Input: [1,2,3]
  Output: [1,2,4]
  Explanation: The array represents the integer 123.
  Example 2:
  
  Input: [4,3,2,1]
  Output: [4,3,2,2]
  Explanation: The array represents the integer 4321.
  
  - Solution Summary:
  
  - Used Resources:
  
  --- Bo Zhou
  '''
  
  
  class Solution:
      def plusOne(self, digits: List[int]) -> List[int]:
          carry = 1
  
          for i in range(len(digits) - 1, -1, -1):
              if carry == 0:
                  break
              n = digits[i]
              n += carry
              new_int = n % 10
              carry = n // 10
              digits[i] = new_int
  
          if carry == 1:
              digits = [1] + digits
  
          return digits
  