LeetCode: 316. Remove Duplicate Letters

LeetCode: 316. Remove Duplicate Letters

题目描述

Given a string which contains only lowercase letters, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.

Example 1:

Input: "bcabc"
Output: "abc"

Example 2:

Input: "cbacdcbc"
Output: "acdb"

解题思路

1. 先保证每个元素都出现一次
2. 再在前面选取最小的元素作为新串的首字母
3. 递归对非首字母的子串做同样的处理

AC 代码

func removeLetters(s string, idx int, ch byte) string {
    for i := idx; i < len(s); i++ {
        if s[i] == ch {
            s = s[:i] + s[i+1:]
            i--
        }
    }
    
    return s
}

func removeDuplicateLetters(s string) string {
    var flags [26]bool
    alpNum := 0

    for i := 0; i < len(s); i++ {
        if flags[s[i]-'a'] == false {
            alpNum++
        }
        flags[s[i]-'a'] = true
    }
    if len(s) == alpNum {
        return s
    }
    
    // 先保证每个元素都出现一次
    first := -1
    for i := len(s)-1; i >= 0; i-- {
        if alpNum == 0 {
            break
        }
        if flags[s[i]-'a'] == true {
            alpNum--
            first = i
            flags[s[i]-'a'] = false
        }
    }
    
    
    // 再在前面选取最小的元素
    min := 0
    for i := 1; i <= first; i++ {
        if s[min] > s[i] {
            min = i
        }
    }
    
    // 删除后面的 min
    s = removeLetters(s, min+1, s[min])
    
    return s[min:min+1]+removeDuplicateLetters(s[min+1:])
}