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.
三、解题思路
贪心算法
- 找一个最小的数,首先要找到最高位的最小值,然后找到次高位的最小值,以此类推。
- 可以从前到后遍历string 一次把char入栈,只要是新元素比栈顶的元素小,那么就删除栈顶的元素,并把新元素入栈。但是这样的删除操作,最多只能做k次,因为你只能删除k个数
- 操作完成后,需要去掉以0开头的情况,以及单独处理只有1个0的情况。另外,操作完成后,栈里面可能多一个元素,比如 “12” 1 这时候栈里面的元素是”12” k = 1 。 由于是最后一个值比较大,所以k没有来的及减少for循环就退出了。那么就要求我们在最终返回值的时候控制返回的长度不能超过num.size() - k
- 题目说简单就简单,说难就难,反正我是做了1个多小时,而且是看到stack的tag才想到的方法。
class Solution {
public:
string removeKdigits(string num, int k) {
if(num.size() == k)return "0";
stack<char> s; vector<char> ret;
int copyK = k;
for (int i = 0; i < num.size(); ++i) {
char ch = num[i];
while(!s.empty() && k > 0 && s.top() > ch){
s.pop();
k--;
}
s.push(ch);
}
while(!s.empty()){
char ch = s.top();
ret.insert(ret.begin(), ch);
s.pop();
}
int j = 0;
while(j < ret.size() && ret[j] == '0')j++;
if(ret.size() == j)return "0";
else return string(ret.begin()+j, ret.begin()+num.size()-copyK);
}
};