1317. Convert Integer to the Sum of Two No-Zero Integers

标签：present   roi   which   HERE   new   tee   least   bsp   The   

Given an integer n. No-Zero integer is a positive integer which doesn‘t contain any 0 in its decimal representation.

Return a list of two integers [A, B] where:

• A and B are No-Zero integers.
• A + B = n

It‘s guarateed 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 don‘t contain any 0 in their decimal representation.

Example 2:

Input: n = 11
Output: [2,9]

Example 3:

Input: n = 10000
Output: [1,9999]

Example 4:

Input: n = 69
Output: [1,68]

Example 5:

Input: n = 1010
Output: [11,999]

Constraints:

• 2 <= n <= 10^4

class Solution {
    public int[] getNoZeroIntegers(int n) {
        int f = 1, l = n - 1;
        while(f <= l){
            String ff = f + "";
            String ll = l + "";
            if(ff.indexOf(‘0‘) < 0 && ll.indexOf(‘0‘) < 0) return new int[]{f,l};
            else{
                f++;
                l = n - f;
                continue;
            }
        }
        return new int[]{};
    }
}

二分法好像可以直接搞。。

1317. Convert Integer to the Sum of Two No-Zero Integers

标签：present   roi   which   HERE   new   tee   least   bsp   The   

原文地址：https://www.cnblogs.com/wentiliangkaihua/p/12190171.html