feat: update leetcode solutions: No.0989. Add to Array-Form of Integer

Author: yanglbme

solution/0900-0999/0989.Add to Array-Form of Integer/README.md

@@ -57,22 +57,49 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+数组从尾到头遍历，分别与 `K` 中的每一位相加，进位保存在 `carry` 中，不进位和则添加到结果列表中。最后逆序结果列表即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def addToArrayForm(self, A: List[int], K: int) -> List[int]:
+        n = len(A) - 1
+        carry, res = 0, []
+        while n >= 0 or K != 0 or carry != 0:
+            carry += (0 if n < 0 else A[n]) + (K % 10)
+            res.append(carry % 10)
+            K //= 10
+            carry //= 10
+            n -= 1
+        return res[::-1]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public List<Integer> addToArrayForm(int[] A, int K) {
+        int n = A.length - 1;
+        List<Integer> res = new ArrayList<>();
+        int carry = 0;
+        while (n >= 0 || K != 0 || carry != 0) {
+            carry += (n < 0 ? 0 : A[n]) + (K % 10);
+            res.add(carry % 10);
+            K /= 10;
+            carry /= 10;
+            --n;
+        }
+        Collections.reverse(res);
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0900-0999/0989.Add to Array-Form of Integer/README_EN.md

@@ -96,13 +96,38 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def addToArrayForm(self, A: List[int], K: int) -> List[int]:
+        n = len(A) - 1
+        carry, res = 0, []
+        while n >= 0 or K != 0 or carry != 0:
+            carry += (0 if n < 0 else A[n]) + (K % 10)
+            res.append(carry % 10)
+            K //= 10
+            carry //= 10
+            n -= 1
+        return res[::-1]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public List<Integer> addToArrayForm(int[] A, int K) {
+        int n = A.length - 1;
+        List<Integer> res = new ArrayList<>();
+        int carry = 0;
+        while (n >= 0 || K != 0 || carry != 0) {
+            carry += (n < 0 ? 0 : A[n]) + (K % 10);
+            res.add(carry % 10);
+            K /= 10;
+            carry /= 10;
+            --n;
+        }
+        Collections.reverse(res);
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0900-0999/0989.Add to Array-Form of Integer/Solution.java

@@ -1,19 +1,16 @@
 class Solution {
     public List<Integer> addToArrayForm(int[] A, int K) {
-        for (int i = A.length - 1; i >= 0 && K != 0; --i) {
-            K += A[i];
-            A[i] = K % 10;
-            K /= 10;
-        }
+        int n = A.length - 1;
         List<Integer> res = new ArrayList<>();
-        while (K != 0) {
-            res.add(K % 10);
+        int carry = 0;
+        while (n >= 0 || K != 0 || carry != 0) {
+            carry += (n < 0 ? 0 : A[n]) + (K % 10);
+            res.add(carry % 10);
             K /= 10;
+            carry /= 10;
+            --n;
         }
         Collections.reverse(res);
-        for (int a : A) {
-            res.add(a);
-        }
         return res;
     }
-}
+}

solution/0900-0999/0989.Add to Array-Form of Integer/Solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def addToArrayForm(self, A: List[int], K: int) -> List[int]:
+        n = len(A) - 1
+        carry, res = 0, []
+        while n >= 0 or K != 0 or carry != 0:
+            carry += (0 if n < 0 else A[n]) + (K % 10)
+            res.append(carry % 10)
+            K //= 10
+            carry //= 10
+            n -= 1
+        return res[::-1]