693. 移掉K位数字
给定一个以字符串表示的非负整数 num,移除这个数中的 k 位数字,使得剩下的数字最小。
样例
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.
注意事项
The length of num is less than 10002 and will be ≥ k.
The given num does not contain any leading zero.
public class Solution {
/**
* @param num: a number
* @param k: the k digits
* @return: the smallest number
*/
public String removeKdigits(String num, int k) {
// write your code here.
if (k >= num.length()) return "0";
char[] arr = num.toCharArray();
char[] ret = new char[num.length() - k];
int flag=0;
for (int i = 0; i < ret.length; i++) {
ret[i] = arr[flag];
for (int j = flag + 1; j <= k+i; j++) {
if (ret[i] > arr[j]) {
ret[i] = arr[j];
flag=j;
}
}
flag++;
}
if (ret[0] == '0'&&ret.length>1) {
flag = 1;
for (; flag < ret.length; flag++) {
if (ret[flag] != '0') {
break;
}
}
char[] rets = new char[ret.length - flag];
System.arraycopy(ret, flag, rets, 0, rets.length);
return new String(rets);
}
return new String(ret);
}
}