解法一:利用BigInteger回溯即可
import java.math.BigInteger;
class Solution {
public String removeDigit(String number, char digit) {
BigInteger max = new BigInteger("0");
String ans = "";
StringBuilder stringBuilder = new StringBuilder(number);
for (int i = 0; i < stringBuilder.length(); i++) {
if (stringBuilder.charAt(i) == digit) {
stringBuilder.deleteCharAt(i);
BigInteger cur = new BigInteger(stringBuilder.toString());
if (max.compareTo(cur) < 0) {
max = cur;
ans = stringBuilder.toString();
}
stringBuilder.insert(i, digit);
}
}
return ans;
}
}
解法二:贪心算法,从前往后找,找到满足number[i] < number[i+1]元素删除,如果删除i前面的digit,数字是变小的,因为删除i后,i+1变成了之前i的位置(从前到后),所以只要找到第一个满足条件的就可以了,如果没有前number.length() - 1元素中没有找到,就从后往前找到第一个等于digit的char删除,改变最小位来得到最大值。
class Solution {
public String removeDigit(String number, char digit) {
boolean find = false;
StringBuilder stringBuilder = new StringBuilder();
char[] chars = number.toCharArray();
// 因为需要用到i+1,所以只遍历到chars.length - 1
for (int i = 0; i < chars.length - 1; i++) {
if (chars[i] == digit && !find) {
if (chars[i + 1] > chars[i]) {
find = true;
continue;
}
}
stringBuilder.append(chars[i]);
}
// 遍历完拼接上最后一个元素
stringBuilder.append(chars[number.length() - 1]);
// 如果前面没有找到符合条件的元素,就删除从后往前找到的第一个digit
if (stringBuilder.length() == number.length()) {
for (int size = stringBuilder.length() - 1; size >= 0; size--) {
if (stringBuilder.charAt(size) == digit) {
stringBuilder.deleteCharAt(size);
break;
}
}
}
return stringBuilder.toString();
}
}