leetcode——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=num.length,则返回0。否则的话，利用贪心算法，从字符串中删除k个数字，则将留下num.length-k个数字。显然，留下的第一个数字肯定位于字符串的前k+1位，为了让新数字尽可能小，所以最高位要尽可能小，故选择第一次出现的最小的数字作为最高位，并从num中删去；同理，留下的第二个数字位于当前num中前k+1位...极端情况下算法时间复杂度为O(n^2)。代码如下：

class Solution {
public:
	string removeKdigits(string num, int k) {
		if(k == num.length())	return "0";
		int p = 0, l=num.length()-k;
		string ans;
		for(int i=0; i<l; i++)
		{
			char min = num[p];
			for(int j=p+1; j<=k; j++)
				if(num[j] < min)
				{
					min = num[j];
					p = j;
				}
			ans += num[p];
			num.erase(p, 1);
		}
		while(ans.length() > 1 && ans[0] == '0')	ans.erase(0, 1);
		return ans;
	}
};

不过呢，算法还可以适当优化，例如，由于p只增不减，所以当每次选择的的数字都位于第k位时，可以不需要继续搜索下去，直接将后面的子串copy即可，可以适当增大时间效率。代码略作修改：

class Solution {
public:
	string removeKdigits(string num, int k) {
		if(k == num.length())	return "0";
		int p = 0, l=num.length()-k;
		string ans;
		for(int i=0; i<l; i++)
		{
			char min = num[p];
			for(int j=p+1; j<=k; j++)
				if(num[j] < min)
				{
					min = num[j];
					p = j;
				}
			if(p == k)
			{
				ans += num.substr(p, num.length()-k);
				break;
			}
			ans += num[p];
			num.erase(p, 1);
		}
		while(ans.length() > 1 && ans[0] == '0')	ans.erase(0, 1);
		return ans;
	}
};