LeetCode # 989 Example 1: Input: num = [1,2,0,0], k = 34 Output: [1,2,3,4] Explanation: 1200 + 34 = 1234 Example 2: Input: num = [9,9,9,9,9,9,9,9,9,9], k = 1 Output: [1,0,0,0,0,0,0,0,0,0,0] Explanation: 9999999999 + 1 = 10000000000 Constraints: 1 = 0 || sum > 0) { if (i >= 0) sum += (num[i]); list.addFirst(sum % 10); sum /= 10; i--; } return list; } } Result #2 💡 ArrayList에서 LinkedList로 자료형 변경 L..
