题目地址:
https://www.lintcode.com/problem/delete-string/description
给定一个非空字符串 s s s,要求删掉一个字符,使得剩余字符串拼接而成的新字符串字典序最小。返回那个最小字典序的字符串。
思路是单调栈。从左向右扫描 s s s,当遇到第一个 s [ i ] > s [ i + 1 ] s[i]>s[i+1] s[i]>s[i+1]的时候删去 s [ i ] s[i] s[i]。注意只删一次。如果一遍扫描下来没有删,则删最后一个字符。代码如下:
public class Solution {
/**
* @param str: the str
* @return: the delete positon
*/
public String deleteString(String str) {
// Write your code here.
StringBuilder sb = new StringBuilder();
boolean removed = false;
for (int i = 0; i < str.length(); i++) {
if (sb.length() > 0 && sb.charAt(sb.length() - 1) > str.charAt(i) && !removed) {
sb.setLength(sb.length() - 1);
removed = true;
}
sb.append(str.charAt(i));
}
if (!removed) {
sb.setLength(sb.length() - 1);
}
return sb.toString();
}
}
时空复杂度 O ( l s ) O(l_s) O(ls)。