[update] one solution

Author: Dream

README.md

@@ -19,7 +19,7 @@
 |993|[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | [java](./algorithm/cousinsInBinaryTree/solution.java) |Easy|
 |991|[Broken Calculator](https://leetcode.com/problems/broken-calculator/) | |Medium|
 |990|[Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) | |Medium|
-|989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) | |Easy|
+|989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) | [java_dream](./algorithms/addToArrayFormOfInteger/AddToArrayFormOfInteger.java)|Easy|
 |988|[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | |Medium|
 |987|[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | |Medium|
 |986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | |Medium|

algorithms/addToArrayFormOfInteger/AddToArrayFormOfInteger.java

@@ -0,0 +1,23 @@
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * @author Dream
+ */
+public class AddToArrayFormOfInteger {
+    public List<Integer> addToArrayForm(int[] num, int k) {
+        int len = num.length;
+        int lastNum = k;
+        LinkedList<Integer> list = new LinkedList<>();
+        int i = len - 1;
+        while (i >= 0 || lastNum > 0) {
+            if (i >= 0) {
+                lastNum += num[i];
+            }
+            list.addFirst(lastNum % 10);
+            lastNum /= 10;
+            i--;
+        }
+        return list;
+    }
+}