Solution Dijkstra-Edu#66 - SJ-Cipher/Edited - 02/02/2025

Author: SJ-Cipher

Arrays & Strings/#66 - Plus One - Easy/Explanation.md

@@ -0,0 +1,5 @@
+Explanation:
+-> Check each element of the array/list from the end to the beginning
+-> If the value is less than 9, add one and return the array/list
+-> Else set it to zero and continue the loop(since the adjacent number might be 9 as well)
+-> If all the numbers are set to zero(meaning all were 9's in input array), insert 1 in the beginning of the array/list and return it

Arrays & Strings/#66 - Plus One - Easy/main.py

@@ -0,0 +1,17 @@
+from typing import List
+
+#SOLUTION
+class Solution:
+    def plusOne(self, digits: List[int]) -> List[int]: 
+        for i in range(len(digits)-1,-1,-1): #iterating the list from the end to beginning
+            if digits[i] < 9: 
+                digits[i]+=1
+                return digits # if digit is less than 9 we add one and return
+            else:
+                digits[i]=0 #else make it zero and continue iterating
+        return [1] + digits # if all are 0 (i.e all 9's), we add one at the start and return
+    
+if __name__ == "__main__":
+    print(Solution().plusOne([9,9,9,9,9])) # Example input
+
+#Time Complexity : O(n)