Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers.Solution

```
public class Solution
extends Object
```
1317 - Convert Integer to the Sum of Two No-Zero Integers.
Easy

No-Zero integer is a positive integer that **does not contain any 0 ** in its decimal representation.

Given an integer n, return a list of two integers [A, B] where:
- A and B are No-Zero integers.
- A + B = n
The test cases are generated so that there is at least one valid solution. If there are many valid solutions you can return any of them.

Example 1:

Input: n = 2

Output: [1,1]

Explanation: A = 1, B = 1. A + B = n and both A and B do not contain any 0 in their decimal representation.

Example 2:

Input: n = 11

Output: [2,9]

Constraints:
- 2 <= n <= 10⁴

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int[] getNoZeroIntegers(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

getNoZeroIntegers

public int[] getNoZeroIntegers(int n)