※ 引述《PATRICKSTARS (PatrickStar)》之铭言：
: Given an integer (not necessary a decimal number) with n digits, we want to
: remove m (<=n) digits from this number such that the resulting number is as
: large as possible. Design an O(n) time algorithm to solve it.
: 可以提示如何下手吗?
从最高位往个位扫
当目前数字 < 下一个
则舍弃目前数字
若下一个没有数字了
也舍弃目前数字
虚拟码
int f (int input, int m){
LinkedList l;
//双向linked list l
//从头到尾是高位到低位digit
if(m >= l.size)
return 0;
p = l.head ;
while (m > 0){
if (p.next== null || p.value < p.next.value ){
if (p.next==null){
p = p.last;
p.next = null;
}
else{
temp = p.last;
temp.next=p.next;
p=temp;
}
m