finished Plus One problem

Author: Github11200

main.py

@@ -55,8 +55,6 @@ def Waiting():
 
 
 # https://leetcode.com/problems/roman-to-integer/editorial/
-
-
 def RomanToInteger():
     class RomanNumerals:
         def __init__(self) -> None:
@@ -82,3 +80,26 @@ def __init__(self) -> None:
         previousNumber = number
 
     print(total)
+
+
+def PlusOne():
+    digits = [1, 2, 3]
+    length = len(digits) - 1
+    number = 0
+
+    for digit in digits:
+        number += digit * pow(10, length)
+        length -= 1
+
+    del length
+    number += 1
+    stringNumber = str(number)
+    del number
+    outputDigits = []
+    for letter in stringNumber:
+        outputDigits.append(int(letter))
+
+    print(outputDigits)
+
+
+PlusOne()

test.py

@@ -0,0 +1,7 @@
+def DigitSum(n):
+    if n < 10:
+        return n
+    return DigitSum(int(n / 10)) + (n % 10)
+
+
+print(DigitSum(2))