[LeetCode 316] Remove Duplicate Letters

最新推荐文章于 2021-03-07 16:00:42 发布

Mavs

最新推荐文章于 2021-03-07 16:00:42 发布

阅读量5.0k

点赞数

分类专栏： Leetcode Java 文章标签： leetcode gready

本文链接：https://blog.csdn.net/sbitswc/article/details/50420035

版权

Leetcode 同时被 2 个专栏收录

287 篇文章 0 订阅

订阅专栏

Java

106 篇文章 0 订阅

订阅专栏

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.

Example:

Given "bcabc"
Return "abc"

Given "cbacdcbc"
Return "acdb"

Solution: reference

After determining the greedy choice s[i], we get a new string s' from s by

removing all letters to the left of s[i],
removing all s[i]'s from s.

public String removeDuplicateLetters(String s) {
        int[] count = new int[26];
        int pos = 0;
        for(int i=0; i<s.length(); i++) count[s.charAt(i) - 'a']++;
        for(int i=0; i<s.length(); i++) {
            if(s.charAt(i)< s.charAt(pos)) pos = i;
            if(--count[s.charAt(i) - 'a'] == 0) break;
        }
        return s.length() == 0? "" : s.charAt(pos) + removeDuplicateLetters(s.substring(pos+1).replaceAll(""+ s.charAt(pos), ""));
    }