1440. Convert Integer To The Sum Of Two No Zero Integers¶

LeetCode Problem View on GitHub

1440. 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: Let a = 1 and b = 1.
Both a and b are no-zero integers, and a + b = 2 = n.

Example 2:

Input: n = 11
Output: [2,9]
Explanation: Let a = 2 and b = 9.
Both a and b are no-zero integers, and a + b = 11 = n.
Note that there are other valid answers as [8, 3] that can be accepted.

Constraints:

• 2 <= n <= 104

Solution¶

class Solution {
    public int[] getNoZeroIntegers(int n) {
        for (int i = 1; i <= n; i++) {
            if (n < i) continue; 
            if (valid(i) && valid(n - i)) {
                return new int[]{i, n - i};
            }
        } 
        return new int[]{-1, -1};
    }
    private boolean valid(int n) {
        int temp = n;
        while (temp > 0) {
            if (temp % 10 == 0)
                return false;
            temp /= 10;
        }
        return true;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Approach¶

Detailed explanation of the approach will be added here