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
andB
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 <= 104
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
for a in range(1, n):
b = n - a
if "0" not in str(a) + str(b):
return [a, b]
class Solution {
public int[] getNoZeroIntegers(int n) {
for (int a = 1; a < n; ++a) {
int b = n - a;
if (!(a + "" + b).contains("0")) {
return new int[] {a, b};
}
}
return null;
}
}
class Solution {
public:
vector<int> getNoZeroIntegers(int n) {
for (int a = 1; a < n; ++a) {
int b = n - a;
if ((to_string(a) + to_string(b)).find('0') == string::npos) return {a, b};
}
return {};
}
};
func getNoZeroIntegers(n int) []int {
for a := 1; a < n; a++ {
b := n - a
if !strings.Contains(strconv.Itoa(a)+strconv.Itoa(b), "0") {
return []int{a, b}
}
}
return nil
}