-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1653-MinimumDeletionsToMakeStringBalanced.go
More file actions
96 lines (84 loc) · 3.01 KB
/
1653-MinimumDeletionsToMakeStringBalanced.go
File metadata and controls
96 lines (84 loc) · 3.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
package main
// 1653. Minimum Deletions to Make String Balanced
// You are given a string s consisting only of characters 'a' and 'b'.
// You can delete any number of characters in s to make s balanced.
// s is balanced if there is no pair of indices (i,j) such that i < j and s[i] = 'b' and s[j]= 'a'.
// Return the minimum number of deletions needed to make s balanced.
// Example 1:
// Input: s = "aababbab"
// Output: 2
// Explanation: You can either:
// Delete the characters at 0-indexed positions 2 and 6 ("aababbab" -> "aaabbb"), or
// Delete the characters at 0-indexed positions 3 and 6 ("aababbab" -> "aabbbb").
// Example 2:
// Input: s = "bbaaaaabb"
// Output: 2
// Explanation: The only solution is to delete the first two characters.
// Constraints:
// 1 <= s.length <= 10^5
// s[i] is 'a' or 'b'.
import "fmt"
import "sort"
import "strings"
// 转化成最长上升子序列问题
func minimumDeletions(s string) int {
inc := []rune{}
for _, ch := range s {
t := ch - 'a'
if len(inc) < 1 {
inc = append(inc, t)
} else {
pos := sort.Search(len(inc), func(i int) bool {
return inc[i] > t
})
if pos == len(inc) {
inc = append(inc, t)
} else {
inc[pos] = t
}
}
}
return len(s) - len(inc)
}
func minimumDeletions1(s string) int {
del := strings.Count(s,"a")
res := del
for _, c := range s {
del += int((c - 'a') * 2-1)
if del < res {
res = del
}
}
return res
}
func main() {
// Example 1:
// Input: s = "aababbab"
// Output: 2
// Explanation: You can either:
// Delete the characters at 0-indexed positions 2 and 6 ("aababbab" -> "aaabbb"), or
// Delete the characters at 0-indexed positions 3 and 6 ("aababbab" -> "aabbbb").
fmt.Println(minimumDeletions("aababbab")) // 2
// Example 2:
// Input: s = "bbaaaaabb"
// Output: 2
// Explanation: The only solution is to delete the first two characters.
fmt.Println(minimumDeletions("bbaaaaabb")) // 2
fmt.Println(minimumDeletions("bbaabaaabb")) // 3
fmt.Println(minimumDeletions("aaaaaaaaaa")) // 0
fmt.Println(minimumDeletions("bbbbbbbbbb")) // 0
fmt.Println(minimumDeletions("ababababab")) // 4
fmt.Println(minimumDeletions("bababababa")) // 5
fmt.Println(minimumDeletions("aaaaabbbbb")) // 0
fmt.Println(minimumDeletions("bbbbbaaaaa")) // 5
fmt.Println(minimumDeletions1("aababbab")) // 2
fmt.Println(minimumDeletions1("bbaaaaabb")) // 2
fmt.Println(minimumDeletions1("bbaabaaabb")) // 3
fmt.Println(minimumDeletions1("bbaabaaabb")) // 3
fmt.Println(minimumDeletions1("aaaaaaaaaa")) // 0
fmt.Println(minimumDeletions1("bbbbbbbbbb")) // 0
fmt.Println(minimumDeletions1("ababababab")) // 4
fmt.Println(minimumDeletions1("bababababa")) // 5
fmt.Println(minimumDeletions1("aaaaabbbbb")) // 0
fmt.Println(minimumDeletions1("bbbbbaaaaa")) // 5
}