Delete Digits

Description:

Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to the original order to become a new positive integer.

Find the smallest integer after remove k digits.

N <= 240 and k <= N,

Example

Given an integer A = "178542", k = 4

return a string "12"

Solution:

class Solution {
public:
    /**
     *@param A: A positive integer which has N digits, A is a string.
     *@param k: Remove k digits.
     *@return: A string
     */
    string DeleteDigits(string A, int k) {
        auto sz = (int)A.length();
        if (sz == 0) return "0";
        string rc = "0";
        int cnt = 0;
        for (int i = 0; i < sz; ++i) {
            auto ch = A[i];
            while (cnt < k && ch < rc.back()) {
                ++cnt;
                rc.pop_back();
            }
            rc.push_back(ch);
        }
        while (cnt < k) {
            rc.pop_back();
            ++cnt;
        }
        int pos = 0;
        while (pos < rc.length() && rc[pos] == '0') ++pos;
        return pos == rc.length() ? "0" : rc.substr(pos);
    }
};

转载于:https://www.cnblogs.com/deofly/p/delete-digits.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值