LeetCode 402. Remove K Digits 题解

贪心算法

【题目】

Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.

Note:

• The length of num is less than 10002 and will be ≥ k.
• The given num does not contain any leading zero.

Example 1:

Input: num = "1432219", k = 3
Output: "1219"
Explanation: Remove the three digits 4, 3, and 2 to form the new number 1219 which is the smallest.

Example 2:

Input: num = "10200", k = 1
Output: "200"
Explanation: Remove the leading 1 and the number is 200. Note that the output must not contain leading zeroes.

Example 3:

Input: num = "10", k = 2
Output: "0"
Explanation: Remove all the digits from the number and it is left with nothing which is 0.

【题解】

其基本思想是利用栈维持一个递增的序列，即将字符串中的字符依次入栈，如果当前字符串比栈顶元素小，就将栈顶元素删

掉(若栈顶元素删除后新的栈顶元素仍比当前字符串小，继续删除)，这样可以保证将当前元素加进去一定可以得到一个较小的序列。

当然我们只删除k个元素，再删除k个元素后将剩余字符串全部压入栈。最后我们只取前len-k个元素构成一个序列即可(应注意字符

串首字符不为0的情况)，如果这样得到的是一个空串那就手动返回0。

在代码实现过程中我们用数组来模拟栈，时间复杂度会有所提高。

【代码】

    string removeKdigits(string num, int k) {
        if (k == 0)
            return num;
        int nLen = num.length();
        if (k == nLen)
            return "0";
        
        int nLen_k = nLen - k;
        char* pTmp = new char[nLen];
        int nPos = 0;
        for (int i = 0; i < nLen; i++) {
            while (k > 0 && nPos > 0 && pTmp[nPos - 1] > num[i]) {
                nPos--;
                k--;
            }
            pTmp[nPos++] = num[i];
        }
        
        int nNot_0 = 0;
        while (pTmp[nNot_0] == '0' && nNot_0 < nPos) //字符串首字符不为0
            nNot_0++;
        
        string strResult = "";
        int nSize = 0;
        for (int i = nNot_0; i < nPos && nSize < nLen_k; i++) { //取len-k个元素
            strResult += pTmp[i];
            nSize++;
        }
        
        if (strResult == "")
            strResult = "0";
        return strResult;
    }