LeetCode Remove Duplicate Letters
来源:互联网 发布:c语言cin怎么用 编辑:程序博客网 时间:2024/05/15 23:47
Description:
Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.
Solution:
贪心问题,解决方案有很多,这里是用了stack来做。
遍历string,对于每个char,如果它比stack的peek小,并且该peek不是最后一次出现则循环出栈,然后如果该char没有在stack中出现,就入栈。
import java.util.*;public class Solution {public String removeDuplicateLetters(String s) {if (s == null)return "";int n = s.length();int last_pos[] = new int[26];for (int i = 0; i < n; i++)last_pos[s.charAt(i) - 'a'] = i;boolean exist[] = new boolean[26];boolean last_time[] = new boolean[26];Stack<Character> stack = new Stack<Character>();for (int i = 0; i < n; i++) {if (!exist[s.charAt(i) - 'a'])while (!stack.isEmpty() && stack.peek() >= s.charAt(i)&& !last_time[stack.peek() - 'a']) {exist[stack.peek() - 'a'] = false;stack.pop();}if (!exist[s.charAt(i) - 'a']) {stack.push(s.charAt(i));exist[s.charAt(i) - 'a'] = true;}if (last_pos[s.charAt(i) - 'a'] == i)last_time[s.charAt(i) - 'a'] = true;}String ret = "";while (!stack.isEmpty()) {ret = stack.pop() + ret;}return ret;}public boolean inPos(int k, int[] pos) {int n = pos.length;for (int i = 0; i < n; i++)if (pos[i] == k)return true;return false;}public static void main(String[] rags) {Solution s = new Solution();System.out.println(s.removeDuplicateLetters("abacb"));}}
0 0
- leetcode Remove Duplicate Letters
- leetcode: Remove Duplicate Letters
- LeetCode Remove Duplicate Letters
- 《leetCode》:Remove Duplicate Letters
- Leetcode: Remove Duplicate Letters
- leetcode--Remove Duplicate Letters
- [Leetcode]Remove Duplicate Letters
- 【Leetcode】Remove Duplicate Letters
- 【leetCode】 Remove Duplicate Letters
- [LeetCode]Remove Duplicate Letters
- Leetcode | Remove Duplicate Letters
- LeetCode -- Remove Duplicate Letters
- [leetcode-316]Remove Duplicate Letters
- [LeetCode 316] Remove Duplicate Letters
- Leetcode 316. Remove Duplicate Letters
- Leetcode 316. Remove Duplicate Letters
- Leetcode之Remove Duplicate Letters
- leetcode 316. Remove Duplicate Letters
- static全局变量 & 全局变量
- Android ActionBarDrawerToggle、DrawerLayout、ActionBar 结合
- 划分树的建树与查询的理解
- 常换常新 PMC SAS/SATA HBA 不输“乌镇”
- MAC中设置android adb环境变量
- LeetCode Remove Duplicate Letters
- Leetcode-127.Word Ladder
- 黑马程序员_多线程1.50的特性
- std::thread vs CreateThread
- win10(UEFI)安装卸载ubuntu
- Qt悬浮窗
- Java2.1
- Cardboard虚拟现实开发技巧(二)之保持手机常亮
- XAMPP端口占用问题的解决