Automatically download all your accepted LeetCode solutions and push them to a GitHub repository — with beautiful READMEs, statistics, and incremental sync.
In this LeetCode problem, we are given a non-negative integer n. The goal is to create a new integer x by taking all the non-zero digits from n and keeping them in their original order. Every zero ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results