给定n位正整数a，去掉其中任意k<=n个数字后，剩下的数字按原次序排列组成一个新的正整数，设计算法找出剩下的数字组成的新数最小的删数方案-Given n-bit positive integer a, removing one arbitrary k <= n In the figures, the remaining number of the original order to form a new positive i