✅Very Easy C++ Solution || Beats 100%🚀🚀 || Simple Approach☑️
Intuition\nFirst thing to Notice here is that we want a and b as NonZero integer which do not contains any 0 in it\n\n# Approach\nFirst we can create a Function
# Intuition\nFirst thing to Notice here is that we want `a and b as NonZero integer which do not contains any 0 in it`\n\n# Approach\nFirst we can **create a Function which returns true if a and b does not contaians any zero** \n\nWe **start** `a from 1` and `b from n-1` and Everytime we **check if a and b are nonZero integers** anf if they are we pushback a and b in ans vector and `return` \n**else we increase** `a++ `and **decrease** `b--`\n\n![image.png](https://assets.leetcode.com/users/images/3505b103-fbfa-42de-b471-54a316049cbe_1727090079.8776815.png)\n\n\n# Complexity\n- Time complexity:\n**O(N)**\n\n- Space complexity:\n**O(1)**\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool isNonZero(int n){\n        while(n>0){\n            if(n%10==0) return false;\n            n/=10;\n        }\n        return true;\n    }\n    vector<int> getNoZeroIntegers(int n) {\n        vector<int>ans;\n        int a=1;\n        int b=n-1;\n\n        while(true){\n            if(isNonZero(a) && isNonZero(b)){\n                ans.push_back(a);\n                ans.push_back(b);\n                return ans;\n            }else{\n                a++;\n                b--;\n            }\n        }\n    }\n};\n```
['C++']